Mean value theorems for binary Egyptian fractions II

Details Mean value theorems for binary Egyptian fractions II Mean value theorems for binary Egyptian fractions II

2011-09-11

arxiv.org/abs/1109.2274v1

Mathematics

Number Theory

9 pages, submitted

Scientific paper

In this article, we continue with our investigation of the Diophantine equation $\frac{a}n=\frac1x+\frac1y$ and in particular its number of solutions $R(n;a)$ for fixed $a$. We prove a couple of mean value theorems for the second moment $(R(n;a))^2$ and from which we deduce $\log R(n;a)$ satisfies a certain Gaussian distribution with mean $\log 3\log\log n$ and variance $(log 3)^2\log\log n$, which is an analog of the classical theorem of Erd\H os and Kac. And finally these results in all suggest that the behavior of $R(n;a)$ resembles the divisor function $d(n^2)$ in various aspects.

Affiliated with

Also associated with

No associations

Rating

Mean value theorems for binary Egyptian fractions II 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 Mean value theorems for binary Egyptian fractions II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mean value theorems for binary Egyptian fractions II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19830