On the primitive circle problem (Q1599513): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s006050200006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000829837 / rank | |||
Normal rank |
Latest revision as of 19:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the primitive circle problem |
scientific article |
Statements
On the primitive circle problem (English)
0 references
10 June 2002
0 references
Let \(V(x)\) be the number of primitive lattice points \((m,n)\) in the circle given by \(m^2+n^2\leq x\), where \((m,n)\) is said to be primitive if \(\text{h.c.f.}(m,n)=1\). Then it is shown, subject to the Riemann hypothesis, that \[ V(x)= \tfrac {6}{\pi}+ O(x^{221/608+ \varepsilon}) \] for any \(\varepsilon> 0\). Unconditionally the best exponent known is only \(1/2\). Previously the best known conditional exponent was \(11/30+ \varepsilon\), due to \textit{W. Zhai} and \textit{X. Cao} [Acta Arith. 90, 1-16 (1999; Zbl 0932.11066)]. Bounds for multidimensional exponential sums are the main ingredient of the proof.
0 references
circle problem
0 references
error term
0 references
bounds for multidimensional exponential sums
0 references
number of primitive lattice points
0 references
Riemann hypothesis
0 references