Skip to content

Erdős problem 680

Start work

Is it true that, for all sufficiently large nn, there exists some kk such that p(n+k)>k2+1, p(n+k)>k^2+1, where p(m)p(m) denotes the least prime factor of mm?

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:7217d07e5440c83a2bfc40545c93094360be8d5197dfd03fa10a325911ab6cc1
Metadata
sha256:dda37159357a94ef8f8d99e6495b8b683603607256807b88ee83786bc47fb577
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:86fe89ad4ed29fa54d4c0813f21a39e719e0a1c0ab43fe8f16310662b0be1c74
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON