On the primitive circle problem
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.
- On certain sums of arithmetic functions involving the GCD and LCM of two positive integers
- Visible lattice points along curves
- Visible lattice points in the sphere
- Almost primes of the form p^c
- Hyperbolic lattice point problems
- Primitive lattice points inside an ellipse
- Oscillations of a given size of some arithmetic error terms
- scientific article; zbMATH DE number 3971629 (Why is no real title available?)
- scientific article; zbMATH DE number 4091608 (Why is no real title available?)
- Piatetski-Shapiro primes from almost primes
- Littlewood's One Circle Problem
- On the number of coprime integer pairs within a circle
- scientific article; zbMATH DE number 5182590 (Why is no real title available?)
- Bézout coefficients of coprime numbers approximate quadratic Bézier curves
- Simultaneous visibility in the integer lattice
- On multiple exponential sums and their applications
- Estimates for k-dimensional spherical summations of arithmetic functions of the GCD and LCM
- Reconstruction of hypermatrices from subhypermatrices
- Counting problems for orthogonal sets and sublattices in function fields
- Lax-Phillips orbit counting in higher rank
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
- Numbers in a given set with (or without) a large prime factor
- Non-Euclidean visibility problems
This page was built for publication: On the primitive circle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599513)