Erdős Problem #690
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
For a fixed index k, let d_k(p) be the natural density of positive integers whose k-th smallest distinct prime divisor equals prime p. Erdős asked whether p↦d_k(p) is unimodal: nondecreasing up to one peak, then nonincreasing. The maintained catalogue records the general question as SOLVED in the sense that uniform unimodality is false, while it is true for k=1,2,3. This is an open-ended status, not a proof that every larger k has been classified by the published paper.
A small example
Exact elementary prime-divisibility density: d_1(2)=1/2, d_1(3)=(1/3)(1−1/2)=1/6 and d_1(5)=(1/5)(1−1/2)(1−1/3)=1/15. This shows the first few values decrease for k=1. For k=2, d_2(3)=1/6 and d_2(5)=1/10, but finite examples alone do not prove unimodality of every prime index.
What is known
For primes q<p, divisibility indicators are independent in natural density by the Chinese remainder theorem. Thus d_k(p)=p^(−1) times the coefficient of z^(k−1) in ∏_{q<p}[(1−1/q)+z/q]. This exact finite polynomial expression is a useful implementation-independent way to compute rational values. Stijn Cambie's PRIMARY 2026 Journal of Number Theory paper, 'Resolution of Erdős' problems about unimodularity', volume 280, pp.271–277, DOI 10.1016/j.jnt.2025.08.014, says unimodality holds for k=1,2,3 and supplies explicit non-unimodality for k=4,…,20. A separate later preprint claims all k≥4 but was not primary-refereed or independently proof-replayed in this tranche, and should not be silently upgraded into the published result. The single counterexample at k=4 already settles the broad 'for fixed k, is it always unimodal?' question negatively.
GCL's current state
The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.
Critical source-scope distinction: Cambie published k<=3 unimodal and k4..20 nonunimodal, remaining k>=21 not inferred.
What remains
Implement exact rational coefficient recurrences for d_k(p); reproduce one strict dip-and-rebound certificate from Cambie's published Theorem 5 for k=4 and check original p-index mapping. Record independently what is proved for 4≤k≤20 versus later claimed extensions; stop after one verified rational witness and theorem interface. Original [Er79e] historical page remains uninspected.
Sources and claim boundaries
Maintained problem #690; https://www.erdosproblems.com/690 ; https://doi.org/10.1016/j.jnt.2025.08.014 ; https://arxiv.org/abs/2501.10333 ; https://www.erdosproblems.com/forum/thread/690 . Historical [Er79e] not fully inspected. GCL original issue return. Historical source pages and full theorem proofs not uniformly inspected. The original full theorem proof and external formal certification remain distinct.
Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1961 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.