Skip to content

Erdős problem 979

Start work

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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:b1a446c732872087c14088229ca8cf47c930cf5d380e9873ae8f24f1234a129c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON