The proof of a conjecture of Graham for sequences containing primes
HTML articles powered by AMS MathViewer
- by Rivka Klein PDF
- Proc. Amer. Math. Soc. 95 (1985), 189-190 Request permission
Abstract:
Let ${a_1} < {a_2} < \cdots < {a_n}$ be a finite sequence of positive integers. R. L. Graham has conjectured that ${\max _{i,j}}\left \{ {{a_i}/({a_i},{a_j})} \right \} \geqslant n$. We verify this conjecture in case at least one of the ${\alpha _i}$’s is prime.References
- R. D. Boyle, On a problem of R. L. Graham, Acta Arith. 34 (1977/78), no. 2, 163–177. MR 465996, DOI 10.4064/aa-34-2-163-177 R. L. Graham, Unsolved problem 5749, Amer. Math. Monthly 77 (1970), 775.
- P. Erdős, Problems and results on combinatorial number theory, A survey of combinatorial theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971) North-Holland, Amsterdam, 1973, pp. 117–138. MR 0360509
- Gerald Weinstein, On a conjecture of Graham concerning greatest common divisors, Proc. Amer. Math. Soc. 63 (1977), no. 1, 33–38. MR 434941, DOI 10.1090/S0002-9939-1977-0434941-3
- Riko Winterle, A problem of R. L. Graham in combinatorial number theory, Proc. Louisiana Conf. on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1970) Louisiana State Univ., Baton Rouge, La., 1970, pp. 357–361. MR 0268152
Additional Information
- © Copyright 1985 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 95 (1985), 189-190
- MSC: Primary 11A05
- DOI: https://doi.org/10.1090/S0002-9939-1985-0801321-2
- MathSciNet review: 801321