Abstract
The following conjecture of R. L. Graham is verified: Ifn≧n 0, wheren 0 is an explicitly computable constant, then for anyn distinct positive integersa 1,a 2, ...,a n we have\(\mathop {\max }\limits_{i,j} \) a i /(a i ,a j ) ≧ ≧n, and equality holds only in two trivial cases. Here (a i ,a j ) stands for the greatest cnmmon divisor ofa i anda j .
Similar content being viewed by others
References
P. Erdős andR. L. Graham,Old and New Problems and Results in Combinatorial Number Theory, Genève, 1980.
R. L. Graham, Unsolved problem 5749,Amer. Math. Monthly,77 (1970), 775.
D. R. Heat-Brown andH. Iwaniec, On the difference between consecutive primes,Invent. Math. 55 (1979), 49–69.