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 p1, ..., pn, pn+1 are the smallest n + 1 prime numbers and n  4, then

(the middle product is short-hand for the primorial of pn)

Notes

  1. Bonse, H. (1907). "Über eine bekannte Eigenschaft der Zahl 30 und ihre Verallgemeinerung". Archiv der Mathematik und Physik. 3 (12): 292–295.
gollark: Also, it's 178, for the v1 stuff anyway.
gollark: I have a complex setup.
gollark: Also, you need a few extra settings for high-security TLS configuration.
gollark: Yes, but you need an external program to handle HTTPS cert autorenewal.
gollark: Eh, I only have a few hundred lines of caddy config.

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.