Misplaced Pages

Euclid number

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Product of prime numbers, plus one

In mathematics, Euclid numbers are integers of the form En = pn# + 1, where pn# is the nth primorial, i.e. the product of the first n prime numbers. They are named after the ancient Greek mathematician Euclid, in connection with Euclid's theorem that there are infinitely many prime numbers.

Examples

For example, the first three primes are 2, 3, 5; their product is 30, and the corresponding Euclid number is 31.

The first few Euclid numbers are 3, 7, 31, 211, 2311, 30031, 510511, 9699691, 223092871, 6469693231, 200560490131, ... (sequence A006862 in the OEIS).

History

It is sometimes falsely stated that Euclid's celebrated proof of the infinitude of prime numbers relied on these numbers. Euclid did not begin with the assumption that the set of all primes is finite. Rather, he said: consider any finite set of primes (he did not assume that it contained only the first n primes, e.g. it could have been {3, 41, 53}) and reasoned from there to the conclusion that at least one prime exists that is not in that set. Nevertheless, Euclid's argument, applied to the set of the first n primes, shows that the nth Euclid number has a prime factor that is not in this set.

Properties

Not all Euclid numbers are prime. E6 = 13# + 1 = 30031 = 59 × 509 is the first composite Euclid number.

Every Euclid number is congruent to 3 modulo 4 since the primorial of which it is composed is twice the product of only odd primes and thus congruent to 2 modulo 4. This property implies that no Euclid number can be a square.

For all n ≥ 3 the last digit of En is 1, since En − 1 is divisible by 2 and 5. In other words, since all primorial numbers greater than E2 have 2 and 5 as prime factors, they are divisible by 10, thus all En ≥ 3 + 1 have a final digit of 1.

Unsolved problems

Unsolved problem in mathematics: Are there an infinite number of prime Euclid numbers? (more unsolved problems in mathematics)

It is not known whether there is an infinite number of prime Euclid numbers (primorial primes). It is also unknown whether every Euclid number is a squarefree number.

Unsolved problem in mathematics: Is every Euclid number squarefree? (more unsolved problems in mathematics)

Generalization

A Euclid number of the second kind (also called Kummer number) is an integer of the form En = pn# − 1, where pn# is the nth primorial. The first few such numbers are:

1, 5, 29, 209, 2309, 30029, 510509, 9699689, 223092869, 6469693229, 200560490129, ... (sequence A057588 in the OEIS)

As with the Euclid numbers, it is not known whether there are infinitely many prime Kummer numbers. The first of these numbers to be composite is 209.

See also

References

  1. Michael Hardy and Catherine Woodgold, "Prime Simplicity", Mathematical Intelligencer, volume 31, number 4, fall 2009, pages 44–52.
  2. "Proposition 20".
  3. Sloane, N. J. A. (ed.). "Sequence A006862 (Euclid numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. Vardi, Ilan (1991). Computational Recreations in Mathematica. Addison-Wesley. pp. 82–89. ISBN 9780201529890.
  5. Sloane, N. J. A. (ed.). "Sequence A125549 (Composite Kummer numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Prime number classes
By formula
By integer sequence
By property
Base-dependent
Patterns
k-tuples
By size
  • Mega (1,000,000+ digits)
  • Largest known
  • Complex numbers
    Composite numbers
    Related topics
    First 60 primes
    List of prime numbers
    Classes of natural numbers
    Powers and related numbers
    Of the form a × 2 ± 1
    Other polynomial numbers
    Recursively defined numbers
    Possessing a specific set of other numbers
    Expressible via specific sums
    Figurate numbers
    2-dimensional
    centered
    non-centered
    3-dimensional
    centered
    non-centered
    pyramidal
    4-dimensional
    non-centered
    Combinatorial numbers
    Primes
    Pseudoprimes
    Arithmetic functions and dynamics
    Divisor functions
    Prime omega functions
    Euler's totient function
    Aliquot sequences
    Primorial
    Other prime factor or divisor related numbers
    Numeral system-dependent numbers
    Arithmetic functions
    and dynamics
    Digit sum
    Digit product
    Coding-related
    Other
    P-adic numbers-related
    Digit-composition related
    Digit-permutation related
    Divisor-related
    Other
    Binary numbers
    Generated via a sieve
    Sorting related
    Natural language related
    Graphemics related
    Categories:
    Euclid number Add topic