Skip to content

Erdős problem 681

Start work

Erdős problem 681. Is it true that for all large nn there exists kk such that n+kn + k is composite and p(n+k)>k2p(n+k) > k^2, where p(m)p(m) is 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:06c138408d5e71420244707b6dd7fa3ef901e6201aa356d17606f5140c822c48
Metadata
sha256:e4aa8e52928fbac0ead25446b12f82f2e364b04321e4f94df1e22568c7ba2c4c
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:136d1dd072dc748de102f00403fb57ffac6853ac19be31b24a65929c264d5a77
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON