Euclid Number

DOWNLOAD Mathematica Notebook

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers

E_n=1+product_(i=1)^(n)p_i
(1)
=1+p_n#,
(2)

known as Euclid numbers, where p_i is the ith prime and p_n# is the primorial.

The first few Euclid numbers are 3, 7, 31, 211, 2311, 30031, 510511, 9699691, 223092871, 6469693231, ... (OEIS A006862; Tietze 1965, p. 19).

The indices n of the first few prime Euclid numbers E_n are 1, 2, 3, 4, 5, 11, 75, 171, 172, 384, 457, 616, 643, ... (OEIS A014545), so the first few Euclid primes (commonly known as primorial primes) are 3, 7, 31, 211, 2311, 200560490131, ... (OEIS A018239). The largest known Euclid number is E_(13494), and it is not known if there are an infinite number of prime Euclid numbers (Guy 1994, Ribenboim 1996).

The largest factors of E_n for n=1, 2, ... are 3, 7, 31, 211, 2311, 509, 277, 27953, ... (OEIS A002585).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.