Claims

../

2004_01_18_ford: Ford's refereed multiplication-table theorem (Ann. of Math. 2008) bounds F(A,B) above by a constant times N^2/((log N)^delta (log log N)^(3/2)) for every pair A, B; the upper half of the site's resolution.

2026_04_26_chojecki: A manuscript of 26 April 2026, credited to GPT-5.5 Pro prompted by Chojecki, builds A and B to match Ford's multiplication-table upper bound, fixing the order of magnitude; accepted by the site's curator.

---