Number theory Quadratic forms and geometry of numbers Problem
Gauss circle problem
Builds on IntegersBig O notationLattice (group)
Problem
For a real number , let be the number of points with , and let . The problem is to determine the infimum of the real numbers such that as , in big O notation.
Remarks
Gauss observed that for : the unit squares centred at the counted points lie between the discs of radius and . So . Sierpiński proved in 1906 that . Hardy and Landau showed independently that is not , so . It is conjectured that , that is, for every . Martin Huxley proved in 2003, and the problem remains open. For example, and , while and .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Big O notation concept
- Integers object
- Lattice (group) concept
- Gauss circle problem problem
Further reading
About this page
| Tag | 26XTJJT267 |
|---|---|
| URI | m2://26XTJJT267 |
| Kind | problem |
| Writing | W0 stub |
| MSC | 11P21 |
| Status | This copy of the site has no build data. Run m2 status 26XTJJT267. |
| About | Gauss circle problem |
| Uses | Integers, Big O notation, Lattice (group) |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.