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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:48f386f234fed736ccfd9a73a1bb55a6745da82bb7a95bcfb2ca563a211cfaf8
Metadata
sha256:fe0c6a2a0403cb6ac6fbddd6aadbb1f18eee7471a6df5716513709d67caee02b
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:b1a446c732872087c14088229ca8cf47c930cf5d380e9873ae8f24f1234a129c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page