Conjectured one-quarter-plus-epsilon error bound in the Gauss circle problem
Establish the conjectured error bound for the Gauss circle problem by proving that, for x > 0, the discrepancy |C(√x) − πx| is O(x^(1/4+ε)) for every ε > 0, where C(√x) denotes the number of integer lattice points inside the circle of radius √x centered at the origin.
References
In 1988. Iwaniec and Mozzochi [4] showed the conjectured bound O(x1/4+€) for e > 0 is related to the Riemann hypothesis.
In 1916, Hardy conjectured that for every $\varepsilon>0$, \begin{align}\label{circleproblem} |N_0(R)-\pi R2|=O\left(R{\frac 12+\varepsilon}\right). \end{align} This conjecture remains open to date.
Determining the best possible bound on $\theta$ such that $E(t)=O(t{\theta})$ is a famous open problem known as the Gauss circle problem.
Moreover, Hardy (1917) conjectured that \begin{equation}\label{Hardy conj} E(t)=O(t{1/4+}) \quad\text{for any}\quad >0. \end{equation}
Hardy conj:
Furthermore, we conjecture that \begin{equation} E(t)=O(t{1/4}(\log t){2/5}) \quad\text{or}\quad E(t)=O(t{1/4}(\log t){1/3}) \quad\text{as}\quad t\to\infty. \end{equation}