Carl St{\o}rmer and his Numbers
Abstract
In many proofs of Fermat's Two Squares Theorem, the smallest least residue solution of the quadratic congruence plays an essential role; here is prime and . Such an 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 to be a St{\o}rmer number of some prime . St{\o}rmer's main interest in his investigations of St{\o}rmer numbers stemmed from his study of identities expressing as finite linear combinations of certain values of the Gregory-MacLaurin series for . Since less than 600 digits of were known by 1900, approximating 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 . We also discuss St{\o}rmer's work on connecting these numbers to Gregory numbers and approximations of .
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}
}