WikiRNG
Rolled Version rolled

Euclid's theorem

Infinitely many prime numbers exist

Euclid's theorem is a fundamental statement in number theory that asserts that there are infinitely many prime numbers. It was first proven by Euclid in his work Elements. There are at least 200 proofs of the theorem.

FabledTop 3%
336,769SP

Badges39 earned

  1. PreprintObscure+93,114 SP
    Cites a preprint.
  2. Vital (Level 4)Obscure+72,358 SP
    One of the 10,000 Level 4 vital articles.
  3. Problem SetObscure+49,666 SP
    Has 20+ math formulas. ยท 86 formulas
  4. arXivObscure+18,876 SP
    Links to arXiv.
  5. EquationObscure+17,512 SP
    Has a math formula.
  6. Featured AbroadObscure+14,125 SP
    Featured or Good in another language.
  7. TalkativeObscure+11,006 SP
    Talk page is 20 kB+. ยท Talk page 44 kB
  1. Hot Off the PressNotable+8,026 SP
    Edited in the last 24 hours.
  2. FractionsNotable+5,891 SP
    Shows a fraction.
  3. All TalkNotable+5,367 SP
    Its talk page is bigger than the article. ยท Talk page 43,951 bytes, article 22,994
  4. Many NamesNotable+3,857 SP
    10+ redirects point here.
  5. JSTORNotable+3,587 SP
    Links to JSTOR.
Notable13
Basic14
rolled by Melioss

there are 200 theorem