On the estimate for a mean value relative to 4/p=1/n₁+1/n₂+1/n₃
classification
🧮 math.NT
keywords
integernumberpositivesolutionscountsdenominatorsdenotediophantine
read the original abstract
For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1, n_2, n_3)$ of the Diophantine equation $$ {4\over n}={1\over n_1}+{1\over n_2}+{1\over n_3}. $$ For the prime number $p$, $f(p)$ can be split into $f_1(p)+f_2(p),$ where $f_i(p)(i=1, 2)$ counts those solutions with exactly $i$ of denominators $n_1, n_2, n_3$ divisible by $p.$ Recently Terence Tao proved that $$ \sum_{p< x}f_1(p)\ll x\exp({c\log x\over \log\log x}) $$ with other results. In this paper we shall improve it to $$ \sum_{p< x}f_1(p)\ll x\log^5x\log\log^2x. $$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.