Claims

../

2026_03_20_chojecki: A note of 20 March 2026 by Przemyslaw Chojecki, written with GPT-5.4: the doubling inequality holds when the primitive reduction has at most three members, the excess at n is at most five, or at most nine integers are covered.

2026_04_30_malekz: A five-page note of 30 April 2026 by Malek Zribi, posting as MalekZ, prepared with 5.5 Pro: the doubling inequality holds for A = {2u, 3v, uv} with gcd(u,v) = 1, v at least 3 odd, u at least 4 and 3 not dividing u, for all m > n at least uv.

2026_08_27_ewing: A partial claim by Lucas Ewing, published 27 August 2026 and submitted to the site's tab the next day, made with GPT 5.6: a computer-assisted candidate proof of the doubling inequality for sets with at most seven primitive elements.

2026_09_05_gessel: A full proof claim of 5 September 2026 by Declan Gessel, made with GPT-6 Astra, that the doubling inequality fails for the 257-smooth integers in (T,256T] at some scale T, with a Lean file; unexamined by the site.

2026_09_05_shoal_rat: A partial claim published on 5 September 2026 under the handle shoal-rat and submitted to the site's tab on 29 September, made with GPT-6 Astra: the inequality holds for primitive sets whose excess at n is at most 15.

---