Mean Value from Representation of Rational Number as Sum of Two Egyptian Fractions

preprint2011arXivOpen access

Abstract

For given positive integers nn and aa, let R(n; a)R(n;\,a) denote the number of positive integer solutions (x, y)(x,\,y) of the Diophantine equation an=1x+1y. {a\over n}={1\over x}+{1\over y}. Write S(N; a)=∑n≤N(n,a)=1R(n; a). S(N;\,a)=\sum_{\substack{n\leq N (n,\,a)=1}}R(n;\,a). Recently Jingjing Huang and R. C. Vaughan proved that for 4≤N4\leq N and a≤2Na\leq 2N, there is an asymptotic formula S(N; a)=3π2a∏p∣ap−1p+1⋅N(log⁡2N+c1(a)log⁡N+c0(a))+Δ(N; a). S(N;\,a)={3\over π^2a}\prod_{p|a}{p-1\over p+1}\cdot N(\log^2N+c_1(a) \log N+c_0(a))+Δ(N;\,a). In this paper, we shall get a more explicit expression with better error term for c0(a)c_0(a).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.