← All problems

Erdős Problem #690 — Unimodality of kth prime-factor densities

47 years old · traced to

Let dk(p)d_k(p) be the density of those integers whose kkth smallest prime factor is pp (i.e. if p1<p2<⋯p_1<p_2<\cdots are the primes dividing nn then pk=pp_k=p). For fixed k≥1k\geq 1 is dk(p)d_k(p) unimodular in pp? That is, it first increases in pp until its maximum then decreases.

References

Progress summary

Refreshed
Open · solution reported

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 kk, the density sequence rises once and then falls as the prime pp increases.

Known results; May 8, 2026 claimed classification

  • Cambie proved unimodality for 1≤k≤31\leq k\leq 3.
  • Cambie proved non-unimodality for 4≤k≤204\leq k\leq 20.
  • Cambie proved eventual decrease for every fixed kk.

On May 8, 2026, Shouqiao Wang and Davide Crapis submitted A Complete Answer to Erdős Problem 690, claiming non-unimodality for every k≥4k\geq 4 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 1≤k≤31\leq k\leq 3 and non-unimodality for every k≥4k\geq 4. Their arguments are unverified.

Current status (as of November 2026): the cases 1≤k≤31\leq k\leq 3 and 4≤k≤204\leq k\leq 20 are established, while the claimed proof of non-unimodality for every k≥4k\geq 4 remains unverified.

Sources

Solutions 2

Lean verifiedThis targets only the k = 4 counterexample, full solution to be submitted on new target.See full solutionHide full solution
  • lean-repository.json61,555 bytesGitHubOpen
    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.pdf95,627 bytesOpen
  • lean-repository.json61,537 bytesGitHubOpen
  • lean-repository.json61,469 bytesGitHubOpen
    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 solutionHide full solution
  • lean-repository.json34,628 bytesGitHubOpen
    Lean verifier error

    The verifier could not finish this check. Retry the verification.

  • lean-repository.json32,979 bytesGitHubOpen
  • lean-repository.json34,563 bytesGitHubOpen
    Lean verifier error

    The verifier could not finish this check. Retry the verification.