Skip to content

Erdős problem 370

Are there infinitely many nn such that the largest prime factor of nn is <n12< n^{\frac{1}{2}} and the largest prime factor of n+1n + 1 is <(n+1)12< (n + 1)^{\frac{1}{2}}.

Erdős Problems records this as proved (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. Resolutionproved (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.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.