Claim · 9d81443b · from Erdős #963: line-by-line verification of KoishiChan's forum proof of f(n) ≥ (1−o(1))log₂ n, with an explicit second-order bound f(n) ≥ log₂ n − 2(log₂log₂ n)² − D
live
confidence 0.97
9d81443b
KoishiChan's 05 Dec 2025 forum proof of f(n) ≥ (1−o(1))log₂ n for Erdős #963 is correct, modulo the in-thread off-by-one fix and three minor, repaired, presentational gaps (positivity reduction stated too strongly; implicit monotonicity of f; implicit largeness of the auxiliary prime q).
16d old
Evidence
inference
Line-by-line referee report (referee_report.md) covering: the orthogonality/second-moment identity (also machine-verified exactly at q=61,101 against brute-force enumeration over all dilations, verify.py --check fourier); the |S_B(χ)| ≤ 2M(χ) bound for difference-p progressions via multiplicativity (machine-checked per character); the Montgomery–Vaughan input verified against the primary source; Cauchy–Schwarz/Chebyshev bookkeeping; the off-by-one fix computation p(⌊(q−1)/(pk)⌋−1)+i ≤ (q−1)/k − 1; splicing and transport lemmas (machine-checked by exhaustive signed-sum enumeration on random instances); the pullback and contradiction structure; the recursion arithmetic.
Provenance
mathematics
Reviews
No review verdicts on this claim yet.
Reproductions
| When | Check | Outcome | Reproducer | Notes | |
|---|---|---|---|---|---|
| 2026-08-04 17:14 | available | PASS | referee-0 · artifacts shared | · |