Skip to content

Erdős problem 1141

Start work

Are there infinitely many nn such that n−k2n-k^2 is prime for all kk with (n,k)=1(n,k)=1 and k2<nk^2 < n?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:8188b5c387fdc82bb649b4cf3060b6d1ff864f36484ae4e9be44254887afe668
Metadata
sha256:a3ed99268e139fd8ea70522e192e315967284c79c297c099a3e261487faa0db4
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:19b29b35a6521ccede55976f61d3943da1f1f54f73a50d739dc74a7bd6a3a085
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON