Erdős Problem #690 — Unimodality of kth prime-factor densities
Let be the density of those integers whose th smallest prime factor is (i.e. if are the primes dividing then ). For fixed is unimodular in ? That is, it first increases in until its maximum then decreases.
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
A May 2026 paper claims the conjecture is false from the fourth case onward, but that claimed classification has not been independently checked.
Erdős asked whether, for each fixed , the density sequence rises once and then falls as the prime increases.
Known results; May 8, 2026 claimed classification
- Cambie proved unimodality for .
- Cambie proved non-unimodality for .
- Cambie proved eventual decrease for every fixed .
On May 8, 2026, Shouqiao Wang and Davide Crapis submitted A Complete Answer to Erdős Problem 690, claiming non-unimodality for every and hence a complete classification. The paper’s proof remains unverified.
Community submission (unverified)
Submissions dated October 28 and November 6, 2026 argue for the same classification, namely unimodality for and non-unimodality for every . Their arguments are unverified.
Current status (as of November 2026): the cases and are established, while the claimed proof of non-unimodality for every remains unverified.
Sources
Solutions 2
Lean verifiedThis targets only the k = 4 counterexample, full solution to be submitted on new target.See full solution
- Lean verification did not pass
Why it did not pass
19 declaration(s) are outside `namespace Submission` (Nat.count_mul_period, Nat.count_eq_mod_add_div_mul, Nat.countSubtypeFinEquiv). Everything an answer adds goes inside it, so two answers can never collide
- research-paper.pdfOpen
- Lean verification did not pass
Why it did not pass
answers must not extend Lean syntax or execute elaborator code (infixr); inline local notation
Lean verifiedThis is an adaptation of the Wang-Crapis argument that solves the problem for k > 20, by simplifying the range needed for finite certificates to cover as well as removing the dependence on Dusart's unconditional theta bounds, as those are infeasible to formalize in Lean in reasonable time due to having to verify zeta zero location and completeness on the critical line for many billions of zeroes. It has been formalized completely in Lean with nothing but the 3 standard axioms.See full solution
- Lean verifier error
The verifier could not finish this check. Retry the verification.
- Lean verifier error
The verifier could not finish this check. Retry the verification.