Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Alexandru Zaharescu, On a conjecture of Graham, J. Number Theory 27 (1987), no. 1, 33--40. The paper proves Graham's conjecture, the statement of Problem 402, for every sufficiently large set. As the zbMATH review (Zbl 0629.10003) states it: let be the largest prime below and ; the paper shows that for every chain of integers some pair has
whenever , and then, through Huxley's bound for large , whenever is sufficiently large. Since is the problem's inequality , this is the problem's claim for every finite set of at least elements. Balasubramanian and Soundararajan describe the argument on p. 1 of their 1996 paper: for a set that violates the conjecture Zaharescu finds with , where for a prime near , then many with coprime to it, a contradiction once is close enough to ; by the nature of the prime-gap input the threshold is of the order . That introduction counts the result as the conjecture "in its weaker form", without the equality case, and the review states only the inequality, while the site's commentary credits Szegedy and Zaharescu with the sharper version that characterizes equality; the page records the disagreement. Szegedy's independent proof is on its own page, and the full resolution on the page of Balasubramanian and Soundararajan.
Covers. The problem's inequality for every finite set with , for some absolute . Not covered: the sets of fewer than elements, where is of the order .
Depends on. No page of this wiki.
Acceptance. Refereed: the Journal of Number Theory is a refereed
journal, and the paper appeared in its volume 27 (1987). The site's
commentary credits Szegedy and Zaharescu with the large-set case, while its
PROVED label settles the problem through Balasubramanian and Soundararajan,
so no reviewed evidence is listed here. The journal record dates the
issue to September 1987, so the page is dated to its first day.