Skip to content

Erdős problem 371

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}.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:276458c6b64f524945bc067e408caeb039ccaef42ecf14bb2f0d7c5218e493ad
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page