Bonse's inequality

In number theory, Bonse's inequality, named after H. Bonse,[1] relates the size of a primorial to the smallest prime that does not appear in its prime factorization. It states that if p₁, ..., p_n, p_n+1 are the smallest n + 1 prime numbers and n ≥ 4, then

p_{n}\#=p_{1}\cdots p_{n}>p_{n+1}^{2}.

(the middle product is short-hand for the primorial $p_{n}\#$ of p_n)

Notes

Bonse, H. (1907). "Über eine bekannte Eigenschaft der Zahl 30 und ihre Verallgemeinerung". Archiv der Mathematik und Physik. 3 (12): 292–295.

gollark: So what stuff has this horribly broken?

gollark: I think it would have been possible to adapt to the new wood-based world with time.

gollark: Not the *entire* world, just lots of it.

gollark: Is it really *that* bad, though?

gollark: Are you *also* going to have to roll krist back 23 hours too?

References

Uspensky, J. V.; Heaslet, M. A. (1939). Elementary Number Theory. New York: McGraw Hill. p. 87.
Zhang, Shaohua (2009). "A new inequality involving primes". arXiv:0908.2943v1 [math.GM].

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Bonse, H. (1907). "Über eine bekannte Eigenschaft der Zahl 30 und ihre Verallgemeinerung". Archiv der Mathematik und Physik. 3 (12): 292–295.