Skip to content

Erdős problem 979

Let k2k ≥ 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 supfk(n)=\limsup f_k(n) = \infty?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/979.lean

Formal Conjectures

FormalConjectures/ErdosProblems/979.leanErdos979.erdos_9791 lineExact file
True ↔ ∀ k ≥ 2, Filter.limsup (fun n => (Erdos979.solutionSet n k).encard) Filter.atTop = ⊤
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page