In mathematics, a Størmer number or arc-cotangent irreducible number is a positive integer for which the greatest prime factor of is greater than or equal to . They are named after Carl Størmer.

Sequence

edit

The first few Størmer numbers are:

1, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 19, 20, ... (sequence A005528 in the OEIS).

Density

edit

John Todd proved that this sequence is neither finite nor cofinite.[1]

Unsolved problem in mathematics:
What is the natural density of the Størmer numbers?

More precisely, the natural density of the Størmer numbers lies between 0.5324 and 0.905. It has been conjectured that their natural density is the natural logarithm of 2, approximately 0.693, but this remains unproven.[2] Because the Størmer numbers have positive density, the Størmer numbers form a large set.

Application

edit

The Størmer numbers arise in connection with the problem of representing the Gregory numbers (arctangents of rational numbers)   as sums of Gregory numbers for integers (arctangents of unit fractions). The Gregory number   may be decomposed by repeatedly multiplying the Gaussian integer   by numbers of the form  , in order to cancel prime factors   from the imaginary part; here   is chosen to be a Størmer number such that   is divisible by  .[3]

References

edit
  1. ^ Todd, John (1949), "A problem on arc tangent relations", American Mathematical Monthly, 56 (8): 517–528, doi:10.2307/2305526, JSTOR 2305526, MR 0031496.
  2. ^ Everest, Graham; Harman, Glyn (2008), "On primitive divisors of  ", Number theory and polynomials, London Math. Soc. Lecture Note Ser., vol. 352, Cambridge Univ. Press, Cambridge, pp. 142–154, arXiv:math/0701234, doi:10.1017/CBO9780511721274.011, MR 2428520. See in particular Theorem 1.4 and Conjecture 1.5.
  3. ^ Conway, John H.; Guy, R. K. (1996), The Book of Numbers, New York: Copernicus Press, pp. 245–248. See in particular p. 245, para. 3.
  NODES
Note 2