Skip to content

Erdős problem 371

Start work

Let P(n)P(n) denote the largest prime factor of nn. Show that the set of nn with P(n+1)>P(n)P(n+1) > P(n) has density 12\frac{1}{2}.

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:1d44fd1e97949147b8c20d54ba23228efeaad8474a1518721685e61fbda8fb2e
Metadata
sha256:3f1f060511f02e9c895a37dcf326d4e83b01b57ebdd1792c03b82a6e962d7e74
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:276458c6b64f524945bc067e408caeb039ccaef42ecf14bb2f0d7c5218e493ad
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON