Counting the number of solutions to the Erdős-Straus equation on unit fractions

From MaRDI portal
Publication:2852274

DOI10.1017/S1446788712000468zbMATH Open1304.11018arXiv1107.1010MaRDI QIDQ2852274FDOQ2852274


Authors: Christian Elsholtz, Terence Tao Edit this on Wikidata


Publication date: 8 October 2013

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Abstract: For any positive integer n, let f(n) denote the number of solutions to the Diophantine equation frac4n=frac1x+frac1y+frac1z with x,y,z positive integers. The emph{ErdH{o}s-Straus conjecture} asserts that f(n)>0 for every ngeq2. To solve this conjecture, it suffices without loss of generality to consider the case when n is a prime p. In this paper we consider the question of bounding the sum sump<Nf(p) asymptotically as Noinfty, where p ranges over primes. Our main result establishes the asymptotic upper and lower bounds N log^2 N ll sum_{p leq N} f(p) ll N log^2 N log log N. In particular, from this bound and the prime number theorem we have f(p)=O(log3ploglogp) for a subset of primes of density arbitrarily close to 1; thus a typical prime has a relatively small number of solutions to the ErdH{o}s-Straus Diophantine equation. We also establish some related results on f and related quantities, for instance establishing the bound for all primes p.


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




Recommendations




Cites Work


Cited In (27)





This page was built for publication: Counting the number of solutions to the Erdős-Straus equation on unit fractions

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