On a coloring conjecture about unit fractions

DOI10.4007/ANNALS.2003.157.545MaRDI QIDQ1425317zbMATH OpenOpenAlexWikidataFDO

Authors Ernest S. III Croot

Publication date 16 March 2004

Published in Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0311421

zbMATH Keywords

sums of unit fractionscolouring problem

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10) Rational numbers as sums of fractions (11D68)

Abstract: We prove an old conjecture of Erd{H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $su{m}_{ninS}1/n=1$.

Recommendations

• Monochromatic solutions to equations with unit fractions
• Sure monochromatic subset sums
• Monochromatic sums equal to products in \(\mathbb N\)
• scientific article; zbMATH DE number 1522524
• On unit fractions with denominators in short intervals

Cited in

(6)

• Analytic number theory. Abstracts from the workshop held November 6--12, 2022
• Sums of four and more unit fractions and approximate parametrizations
• An excursion into nonlinear Ramsey theory
• On Egyptian fractions of length 3
• The number of representations of rationals as a sum of unit fractions
• Monochromatic solutions for multi-term unknowns

This page was built for publication: On a coloring conjecture about unit fractions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1425317)