A Note on Terence Tao's Paper "On the Number of Solutions to 4/p=1/n_1+1/n_2+1/n_3"

preprint2011arXivOpen access

Abstract

For the positive integer nn, let f(n)f(n) denote the number of positive integer solutions (n1, n2, n3)(n_1,\,n_2,\,n_3) of the Diophantine equation 4n=1n1+1n2+1n3. {4\over n}={1\over n_1}+{1\over n_2}+{1\over n_3}. For the prime number pp, f(p)f(p) can be split into f1(p)+f2(p),f_1(p)+f_2(p), where fi(p)(i=1, 2)f_i(p)(i=1,\,2) counts those solutions with exactly ii of denominatorsn1, n2, n3n_1,\,n_2,\,n_3 divisible by p.p. Recently Terence Tao proved that ∑p<xf2(p)≪xlog⁡2xlog⁡log⁡x \sum_{p< x}f_2(p)\ll x\log^2x\log\log x with other results. But actually only the upper bound xlog⁡2xlog⁡log⁡2xx\log^2x\log\log^2x can be obtained in his discussion. In this note we shall use an elementary method to save a factor log⁡log⁡x\log\log x and recover the above estimate.

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.