Erdős problem 979

Let $k ≥ 2$ , and let $f_k(n)$ count the number of solutions to $n = p_1^k + \dots + p_k^k$ , where the $p_i$ are prime numbers. Is it true that $\limsup f_k(n) = \infty$ ?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages

What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Where the source files it575 share a topic

Carrying a Standing. Browse the topic.