Skip to content

Erdős problem 979

Let k≥2k ≥ 2, and let fk(n)f_k(n) count the number of solutions to n=p1k+⋯+pkkn = p_1^k + \dots + p_k^k, where the pip_i are prime numbers. Is it true that lim sup⁡fk(n)=∞\limsup f_k(n) = \infty?

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

979.lean

Retained formal statement3 of 3

Erdős (unpublished)

FormalConjectures/ErdosProblems/979.leanErdos979.erdos_979.variants.k31 lineExact file
Filter.limsup (fun n => (Erdos979.solutionSet n 3).encard) Filter.atTop = ⊤
SolvedStatement only, no proof