Claims

../

1964_03_20_erdos: Erdős's 1964 theorem (Mathematics of Computation) that for each fixed r the largest set of integers up to N with no r of equal pairwise gcd has size between N^{c_r/log log N} and N^{3/4+eps}; refereed.

1970_11_01_abbott_hanson: Abbott and Hanson (Bull. London Math. Soc. 1970) improve Erdős's upper bound for the largest set of integers up to N with no r of equal pairwise gcd to N^{1/2+eps}, as Erdős's 1973 survey reports it; refereed.

---