Home▸Mathematics▸Gauss Circle Problem: Lattice Point Count, Error Term and Sums of Two Squares

Gauss Circle Problem: Lattice Point Count, Error Term and Sums of Two Squares

Count the integer lattice points inside a circle and compare with its area. Grow the radius, shift the centre, and watch the count N(r) step up at every sum of two squares while the error N(r) minus pi r squared stays far smaller than the circumference. A Blender-built board and ring with instanced lattice points, and numerical checks including Jacobi sum of two squares formula and brute-force counts.

Mathematics3DModerate60 FPS📱 Mobile-adapted🟠 Blender⇄ 2D version
Gauss Circle Problem: Lattice Point Count, Error Term and Sums of Two Squares ↗ Open standalone

Count the integer lattice points inside a circle and compare with its area. Grow the radius, shift the centre, and watch the count N(r) step up at every sum of two squares while the error N(r) minus pi r squared stays far smaller than the circumference. A Blender-built board and ring with instanced lattice points, and numerical checks including Jacobi sum of two squares formula and brute-force counts.

⚙ Under the hood

Count the integer lattice points inside a circle and compare with its area. Grow the radius, shift the centre, and watch the count N(r) step up at every sum of two squares while the error N(r) minus pi r squared stays far smaller than the circumference. A Blender-built board and ring with instanced lattice points, and numerical checks including Jacobi sum of two squares formula and brute-force counts.

Math PlatformResearchGauss Circle ProblemLattice PointsSum of Two SquaresNumber TheoryError Term

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)