We prove new upper bounds on the number of representations of rational numbers (Formula presented.) as a sum of four unit fractions, giving five different regions, depending on the size of (Formula presented.) in terms of (Formula presented.). In particular, we improve the most relevant cases, when (Formula presented.) is small, and when (Formula presented.) is close to (Formula presented.). The improvements stem from not only studying complete parametrizations of the set of solutions, but simplifying this set appropriately. Certain subsets of all parameters define the set of all solutions, up to applications of divisor functions, which has little impact on the upper bound of the number of solutions. These ‘approximate parametrizations’ were the key point to enable computer programmes to filter through a large number of equations and inequalities. Furthermore, this result leads to new upper bounds for the number of representations of rational numbers as sums of more than four unit fractions.
- Diophantine equations
- unit fractions
ASJC Scopus subject areas
Fields of Expertise
- Information, Communication & Computing