Erdős Problem #690 — Let be the density of those integers whose th smallest prime factor is (i.
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 new preprint claims to settle the problem completely, but its proof has not received independent mathematical verification.
Erdős asked whether, for each fixed , the densities indexed by the prime rise to one maximum and then fall. The known classification is complete for , while the remaining cases had been open.
Known results
- Cambie proved unimodality for .
- Cambie proved non-unimodality for .
- Cambie proved eventual decrease for every fixed .
Recent claimed complete resolution
Shouqiao Wang and Davide Crapis claim that the sequence is non-unimodal for every , using prime-gap arguments, certified computations, and a Chinese-remainder construction. Their preprint says the proof was produced by “Fields” with limited human interaction; this is an unverified claim, with no independent expert assessment found.
Community submission (unverified), October 28, 2026
A submitted paper argues that non-unimodality holds for every , which would settle the classification; the submission itself is unverified.
Current status (as of October 2026): The cases and are established, while the claimed result for every remains unverified.
Solutions 1
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 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