English

Carl St{\o}rmer and his Numbers

History and Overview 2026-04-30 v3 Number Theory

Abstract

In many proofs of Fermat's Two Squares Theorem, the smallest least residue solution x0x_0 of the quadratic congruence x21modpx^2 \equiv -1 \bmod p plays an essential role; here pp is prime and p1mod4p \equiv 1 \bmod 4. Such an x0x_0 is called a St{\o}rmer number, named after the Norwegian mathematician and astronomer Carl St{\o}rmer (1874-1957). In this paper, we establish necessary and sufficient conditions for x0Nx_0 \in \mathbb{N} to be a St{\o}rmer number of some prime p1mod4p \equiv 1 \bmod 4. St{\o}rmer's main interest in his investigations of St{\o}rmer numbers stemmed from his study of identities expressing π\pi as finite linear combinations of certain values of the Gregory-MacLaurin series for arctan(1/x)\arctan(1/x). Since less than 600 digits of π\pi were known by 1900, approximating π\pi was an important topic. One such identity, discovered by St{\o}rmer in 1896, was used by Yasumasa Kanada and his team in 2002 to obtain 1.24 trillion digits of π\pi. We also discuss St{\o}rmer's work on connecting these numbers to Gregory numbers and approximations of π\pi.

Keywords

Cite

@article{arxiv.2511.03030,
  title  = {Carl St{\o}rmer and his Numbers},
  author = {Matthew Kroesche and Lance L. Littlejohn and Graeme Reinhart},
  journal= {arXiv preprint arXiv:2511.03030},
  year   = {2026}
}