Claims

../

2026_03_02_barreto: A construction posted to the site's thread in March 2026, attributed by its poster to GPT-5.2 Pro, gives infinitely many n with every prime up to (2+eps) log n dividing the next log n integers, for each eps < 3/log 4 - 2.

2026_03_03_sothanaphan: A write-up produced by GPT-5.2 Thinking and posted to the site's thread on 3 March 2026 proves infinitely many n with q(n, log n) at least (1/2 + o(1)) log n log log n over log log log n, answering the question for every constant.

---