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.
>>>PUT SHARE BUTTONS HERE<<<
👉 Euclid's theorem in the context of Dirichlet's theorem on arithmetic progressions
In number theory, Dirichlet's theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n is also a positive integer. In other words, there are infinitely many primes that are congruent to a modulo d. The numbers of the form a + nd form an arithmetic progression
and Dirichlet's theorem states that this sequence contains infinitely many prime numbers. The theorem extends Euclid's theorem that there are infinitely many prime numbers (of the form 1 + 2n). Stronger forms of Dirichlet's theorem state that for any such arithmetic progression, the sum of the reciprocals of the prime numbers in the progression diverges and that different such arithmetic progressions with the same modulus have approximately the same proportions of primes. Equivalently, the primes are evenly distributed (asymptotically) among the congruence classes modulo d containing a's coprime to d.
In this Dossier
Euclid's theorem in the context of Euclid's Elements
The Elements (Ancient Greek: Στοιχεῖα Stoikheîa) is a mathematical treatise written c. 300 BC by the Ancient Greek mathematician Euclid.
The Elements is the oldest extant large-scale deductive treatment of mathematics. Drawing on the works of earlier mathematicians such as Hippocrates of Chios, Eudoxus of Cnidus, and Theaetetus, the Elements is a collection in 13 books of definitions, postulates, geometric constructions, and theorems with their proofs that covers plane and solid Euclidean geometry, elementary number theory, and incommensurability. These include the Pythagorean theorem, Thales' theorem, the Euclidean algorithm for greatest common divisors, Euclid's theorem that there are infinitely many prime numbers, and the construction of regular polygons and polyhedra.
Euclid's theorem in the context of Largest known prime number
The largest known prime number is 2 − 1, a number which has 41,024,320 digits when written in the decimal system. It was found on October 12, 2024, on a cloud-based virtual machine volunteered by Luke Durant, a 36-year-old researcher from San Jose, California, to the Great Internet Mersenne Prime Search (GIMPS).
A prime number is a natural number greater than 1 with no divisors other than 1 and itself. Euclid's theorem proves that for any given prime number, there will always be a higher one, and thus there are infinitely many; there is no largest prime.