Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The size of oscillations in the Goldbach conjecture (2006.14742v1)

Published 26 Jun 2020 in math.NT

Abstract: Let $R(n) = \sum_{a+b=n} \Lambda(a)\Lambda(b)$, where $\Lambda(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq x} R(n) = x2/2 - 4x{3/2} G(x) + O(x{1+\epsilon})$, where $G(x)=\Re \sum_{\gamma>0} \frac{x{i\gamma}}{(\frac{1}{2} + i\gamma)(\frac{3}{2} + i\gamma)}$ and the sum is over the ordinates of the nontrivial zeros of the Riemann zeta function in the upper half-plane. We prove (on RH) that each of the inequalities $G(x) < -0.02093$ and $G(x)> 0.02092$ hold infinitely often, and establish improved bounds under an assumption of linearly independence for zeros of the zeta function. We also show that the bounds we obtain are very close to optimal.

Summary

We haven't generated a summary for this paper yet.