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 , let denote the number of positive integer solutions of the Diophantine equation {4over n}={1over n_1}+{1over n_2}+{1over n_3}. For the prime number , can be split into where counts those solutions with exactly of denominators divisible by 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.
Recommendations
Cites work
Cited in
(5)- Asymmetric entanglement-assisted quantum codes: bound and constructions
- Error term of the mean value theorem for binary Egyptian fractions
- Averaged forms of two conjectures of Erdős and Pomerance, and their applications
- Counting the number of solutions to the Erdős-Straus equation on unit fractions
- A note on the Erdős-Straus conjecture
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)