Claims

../

1971_12_01_choi: Choi's 1971 bound f(n) << n^{3/4} (Proc. London Math. Soc.) for his interval function, the first upper bound for Problem 788, stated with his conjecture n^{1/2+o(1)}; refereed, known here through the papers that cite it.

2000_01_01_baltz_schoen_srivastav: Theorem 2 of Baltz, Schoen and Srivastav (Colloq. Math. 2000): f(n) is O(n^{2/3} (log n)^{2/3}), the best refereed upper bound for Problem 788, with the greedy lower bound f(n) >= sqrt(n) of p. 172; refereed.

2026_07_19_wang: A 2026 manuscript by Shouqiao Wang, found by an AI pipeline using GPT-5.6 Sol, claiming c sqrt(n log n) <= f(n) <= n^(1/2+o(1)) and so Choi's conjectured exponent one half, with a Lean development; unreviewed.

---