Erdős–Graham problem

In combinatorial number theory, the Erdős–Graham problem is the problem of proving that, if the set {2, 3, 4, ...} of integers greater than one is partitioned into finitely many subsets, then one of the subsets can be used to form an Egyptian fraction representation of unity. That is, for every r > 0, and every r-coloring of the integers greater than one, there is a finite monochromatic subset S of these integers such that

In more detail, Paul Erdős and Ronald Graham conjectured that, for sufficiently large r, the largest member of S could be bounded by br for some constant b independent of r. It was known that, for this to be true, b must be at least e.

Ernie Croot proved the conjecture as part of his Ph.D thesis, and later (while a post-doctoral student at UC Berkeley) published the proof in the Annals of Mathematics. The value Croot gives for b is very large: it is at most e167000. Croot's result follows as a corollary of a more general theorem stating the existence of Egyptian fraction representations of unity for sets C of smooth numbers in intervals of the form [X, X1+δ], where C contains sufficiently many numbers so that the sum of their reciprocals is at least six. The Erdős–Graham conjecture follows from this result by showing that one can find an interval of this form in which the sum of the reciprocals of all smooth numbers is at least 6r; therefore, if the integers are r-colored there must be a monochromatic subset C satisfying the conditions of Croot's theorem.

See also

References

External links

This article is issued from Wikipedia - version of the 8/2/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.