论文信息 - The solution of graham’s greatest common divisor problem

The solution of graham’s greatest common divisor problem

AbstractThe following conjecture of R. L. Graham is verified: Ifn≧n0, wheren0 is an explicitly computable constant, then for anyn distinct positive integersa1,a2, ...,an we have $$\mathop {\max }\limits_{i,j} $$ ai/(ai,aj) ≧ ≧n, and equality holds only in two trivial cases. Here (ai,aj) stands for the greatest cnmmon divisor ofai andaj.

Mario Szegedy | M. Szegedy

[1] P. Erdos,et al. Old and new problems and results in combinatorial number theory , 1980 .

[2] D. R. Heath-Brown,et al. On the difference between consecutive primes , 1979 .

[3] Paul Erdös. A Survey of Problems in Combinatorial Number Theory , 1980 .