Gauss circle problem
Problem of counting integer points within a circle of given radius centered at the origin
In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius r {\displaystyle r} . This number is approximated by the area of the circle, so the real problem is to accurately bound the error term describing how the number of points differs from the area.
Nº Q2096220 ★
Common · Knowledge
Gauss circle problem
Problem of counting integer points within a circle of given radius centered at the origin
In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius r {\displaystyle r} . This number is approximated by the area of the circle, so the real problem is to accurately bound the error term describing how the number of points differs from the area.
From Wikipedia
In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius r {\displaystyle r} . This number is approximated by the area of the circle, so the real problem is to accurately bound the error term describing how the number of points differs from the area. The first progress on a solution was made by Carl Friedrich Gauss, hence its name.
Text: Wikipédia, CC BY-SA 4.0. · Image: David Eppstein (CC0) ·
Related cards
-
Squaring the circle
Geometric problem
Nº Q193394 ★★★
Not listed
-
Theorema Egregium
"Remarkable theorem" about Gauss' curvature as an invariant
Nº Q1048874 ★★
Not listed
-
Gauss–Bonnet theorem
Theorem in differential geometry
Nº Q742833 ★★
Not listed
-
G
Gauss's lemma (number theory)
Condition under which a integer is a quadratic residue
Nº Q2526246 ★
Not listed
-
Gaussian integral
Theorem
Nº Q1060321 ★★★
Not listed
-
G
Gauss–Legendre algorithm
Quadratically converging iterative algorithm for computing π
Nº Q2448949 ★
Not listed