Claims

../

2026_01_11_barreto_leeham: A disproof posted to the site's discussion thread on 2026-01-11, found with ChatGPT and formalized with Aristotle, gives infinitely many n for which no n - 2^k has fewer than log log prime factors; curator-credited, not refereed.

2026_01_11_tao_alexeev: Infinitely many n such that every n - 2^k with 2^k <= n has at least a constant times sqrt(log n / log log n) prime factors; the quantified disproof the site credits to Tao and Alexeev, proved in community Lean.

---