On a conjecture of Graham (Q1093662): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5661970 / rank | |||
Normal rank |
Latest revision as of 13:00, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a conjecture of Graham |
scientific article |
Statements
On a conjecture of Graham (English)
0 references
1987
0 references
A well-known problem due to \textit{R. L. Graham} [Am. Math. Mon. 77, 775 (1970)] is the following: is it true that, for every chain \(0<a_ 1<...<a_ n\) of integers, there exist i,j such that \(\max_{i,j}(a_ i/(a_ i,a_ j))\geq n ?\) Let p(n) denote the largest prime number \(<2n\), and put \(f(n)=2n-p(n)\). The author shows that the answer to Graham's question is in the affirmative for all n for which \(f(n)<\sqrt{n}\). He then refines his argument to make use of Huxley's result \(f(n)\leq n^{7/12+\epsilon}\) for all sufficiently large n to confirm that Graham's conjecture is true when n is sufficiently big. [See \textit{M. Szegedy}, Combinatorica 6, 67-71 (1986; Zbl 0593.10002) for a proof of Graham's conjecture.]
0 references
gaps between primes
0 references
greatest common divisor
0 references
Graham's conjecture
0 references