Erdős Problem #696 — Prime and divisor congruence chains
Let be the largest such that there is a sequence of primes all dividing with . Let be the largest such that there is a sequence of integers all dividing with . Estimate and . Is it true that for almost all ?
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
A recent unverified proof claims the conjectured divergence is false: for almost all integers, the ratio approaches two instead.
Erdős Problem asks whether the longest chain of arbitrary divisors is asymptotically much longer than the corresponding chain of prime divisors. Erdős proposed divergence of this ratio and conjectured that the prime-chain length has normal order .
Known results
- Wouter van Doorn proved that for almost all .
- An earlier argument claimed and for almost all .
Claimed precise asymptotics (date not stated)
David Turturean’s write-up claims, for all but integers , that , , and .
Current status (as of March 2026): The original divergence conjecture has a claimed counterexample, but the precise asymptotics and resulting resolution remain unverified.
Solutions 0
No solutions have been posted yet.