The estimate for mean values on prime numbers relative to 4p = 1n₁ + 1 n₂ + 1 n₃

From MaRDI portal
Publication:424285




Abstract: For the positive integer n, let f(n) denote the number of positive integer solutions (n1,n2,n3) of the Diophantine equation {4over n}={1over n_1}+{1over n_2}+{1over n_3}. For the prime number p, f(p) can be split into f1(p)+f2(p), where fi(p)(i=1,2) counts those solutions with exactly i of denominators n1,n2,n3 divisible by p. Recently Terence Tao proved that sum_{p< x}f_1(p)ll xexp({clog xover loglog x}) with other results. In this paper we shall improve it to sum_{p< x}f_1(p)ll xlog^5xloglog^2x.









This page was built for publication: The estimate for mean values on prime numbers relative to \(\frac{4}{p} = \frac{1}{n_1} + \frac{1} {n_2} + \frac{1} {n_3}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424285)