The number of integer radii r <= n for which the lattice-point count C(r) is prime is empirically about n/log n, just like ordinary primes.
On the divisor and circle problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.GM 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Gauss Circle Primes
The number of integer radii r <= n for which the lattice-point count C(r) is prime is empirically about n/log n, just like ordinary primes.