The multiplication table constant and sums of two squares

From MaRDI portal





In this paper, an asymptotically tight formula is given for the number of integers \(n\leq x\) that can be written as \(n=a^2+p^2\) where \(p\) is a prime and \(a\) is a positive integer; furthermore, the secondary term is also estimated. Namely, the authors prove that the number of integers admitting such a representation is \N\[\N\frac{\pi}{2}\cdot \frac{x}{\log x}-\frac{x(\log\log x)^{O(1)}}{(\log x)^{1+\delta}},\N\]\Nwhere \(\delta:=1-\frac{1+\log\log 2}{\log 2}\) is the multiplication table constant.\N\NThey also formulate a conjecture -- supported by some heuristics -- stating that the secondary term is asymptotic to \N\[\N\frac{\psi\left(\frac{\log\log x}{\log 2} \right)}{\sqrt{\log\log x}}\cdot \frac{x}{(\log x)^{1+\delta}},\N\]\Nwhere \(\psi(t)\) is a 1-periodic continuous, non-constant, positive-valued function.











This page was built for publication: The multiplication table constant and sums of two squares

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