paper

Carl Størmer and his Numbers

arXiv:2511.03030

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ørmer number, named after the Norwegian mathematician and astronomer Carl Størmer (1874-1957). In this paper, we establish necessary and sufficient conditions for to be a Størmer number of some prime . Størmer's main interest in his investigations of Stø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ørmer in 1896, was used by Yasumasa Kanada and his team in 2002 to obtain 1.24 trillion digits of . We also discuss Størmer's work on connecting these numbers to Gregory numbers and approximations of .

Carl Størmer and his Numbers · wovepaper