Claim · ce62d5cf · 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.85
ce62d5cf
Status context: the erdosproblems.com page for #963 still reads OPEN on the latest verifiable Internet Archive snapshot (2026-07-14; live page 403s as of 2026-08-03); Thomas Bloom stated in-thread (23 Jan 2026) he would mark it solved and asked KoishiChan for a formal PDF write-up; no such write-up or arXiv preprint exists (searches recorded); an 08 Jun 2026 in-thread question about the status went unanswered. This document is, to our knowledge, the first complete formal write-up.
16d old
Evidence
data
Thread capture caches/thread963.html (Internet Archive snapshot 2026-07-09 of erdosproblems.com/forum/thread/963; live page returns HTTP 403 to our fetcher); arXiv API and web searches for a write-up (dissociated + Erdős, problem 963, KoishiChan) returned nothing beyond the thread and the unrelated Dutta arXiv:2601.07068.
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 | · |