Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Write for the largest size of a set in which every integer has at most representations with , and for the largest size of a set in which every nonzero difference has at most ordered representations . Ho proves (Theorem 1 of the write-up) that for every fixed , with ,
If the constants and of the statement exist, then , so both questions are answered yes: and for every . The separation holds without assuming that either limit exists.
The upper bound adapts the Erdős–Turán argument for Sidon sets: counting pairs of elements of inside windows of length by Cauchy–Schwarz and by the difference bound gives for . The lower bound is the finite construction of Cilleruelo, Ruzsa and Trujillo (Theorem 2.1 of cilleruelo_2002_upper_lower_bounds_finite_b_h, J. Number Theory 97 (2002), 26–34), re-proved in the write-up: a Singer cyclic Sidon set of size modulo is lifted along the pattern , which has at most ordered representations of every sum, and the prime number theorem supplies a prime of the right size. For the bounds read and .
The write-up was posted on 2026-04-22. A revision of 2026-05-03 adds an acknowledgement that GPT-5.4 Pro contributed materially to the arguments, proofs and exposition, and that the author accepts responsibility for the final text; the mathematics is unchanged. The site credits the observation to Ho and GPT-5.4 Pro.
Acceptance. The site's curator, T. F. Bloom, accepted the argument: the problem is labeled proved and the remarks state the two bounds and the resulting inequality (page last edited 2026-04-24), two days after the write-up was posted to the forum. That is the reviewed evidence. The construction half is refereed as part of the Cilleruelo–Ruzsa–Trujillo paper, but the write-up itself and the inequality it draws are not refereed, so the claim lists no refereed evidence.
Depends on. Nothing in this wiki; the inputs are the refereed construction cited above and the elementary window count.