Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Remark 1. "The proof gives a quantitative bound. For each fixed , there is a constant such that
for all sufficiently large . We do not attempt to optimize ." (p. 1, quoted as printed.)
Discrepancy of form, recorded here. The site's commentary on Problem 1014
and the formal-conjectures variant erdos_1014.variants.upper_bound print
with one constant for all
. The manuscript states only depending on ; the in the
denominator is a reading of its proof, which takes a -th root with
of a quantity bounded by a fixed negative power of . No value
of is stated for any , and nothing in the manuscript claims
.
Source. OpenAI, On the ratio of and , three-page manuscript hosted at cdn.openai.com (retrieved 2026-09-18); Remark 1 on p. 1, read on the page image and in the text layer; the same provenance and attribution as Theorem 1.
Read depth. Claims checked: the remark was read clause by clause on the page image. Its justification is the last display of the proof of Theorem 1 (p. 2), read for structure and not checked.
Proof pointer
The proof of Theorem 1 (pp. 2--3): the right side of display (3) is bounded by fixed negative powers of through Lemmas 1--2, and the -th root with gives the rate; the manuscript does not write the exponent out.
Dependencies
The proof of Theorem 1 and its three lemmas.
Bears on
- Problem 544: with (the manuscript's first argument) and the problem's as , the remark reads for all large , the site's consequence ; an authored one-line specialization made on the problem page. It bounds the increment above by and gives no lower bound, so it decides neither question of the problem unless , which is not claimed.
- Problem 1014: the quantitative form the site's commentary reports, in the manuscript's own words.