Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers

Sara Moore, Jonathan P. Sorenson

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is…