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?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it579 share a topic
Number Theory576Primes61
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources