Counting the number of solutions to the Erdos-Straus equation on unit fractions

Details Counting the number of solutions to the Erdos-Straus equation on unit fractions Counting the number of solutions to the Erdos-Straus equation on unit fractions

2011-07-06

arxiv.org/abs/1107.1010v3

Mathematics

Number Theory

42 pages, two figures. This is a major revision of the paper, now joint with Christian Elsholtz, incorporating many new result

Scientific paper

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that $f(n) > 0$ for every $n \geq 2$. 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 $\sum_{p

Affiliated with

Also associated with

No associations

Rating

Counting the number of solutions to the Erdos-Straus equation on unit fractions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting the number of solutions to the Erdos-Straus equation on unit fractions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting the number of solutions to the Erdos-Straus equation on unit fractions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677455