Skip to content
Category

Theorems about prime numbers

page 1
fundamental theorem of arithmetic
theorem about prime factorization of a number
Fermat's little theorem
mathematical theorem that, for any prime 𝑝, the 𝑝th power of any integer 𝑛 is congruent to 𝑛 modulo 𝑝
prime number theorem
theorem in number theory
Wilson's theorem
necessary and sufficient condition for a number to be prime
Bertrand's postulate
theorem
Euclid's theorem
theorem that the number of prime numbers is infinite
Euclid's lemma
lemma
Green–Tao theorem
theorem
Dirichlet's theorem on arithmetic progressions
theorem that, for coprime 𝑎 and 𝑑, there are infinitely many primes congruent to 𝑎 modulo 𝑑
Euler's criterion
in number theory concerning primes
Chen's theorem
mathematics theorem in number theory, which was first stated and proved by Chen Jingrun
Mertens' theorems
series of three theorems about the density of prime numbers
Brun's theorem
theorem that the sum of the reciprocals of the twin primes converges
Lucas' theorem
theorem
divergence of the sum of the reciprocals of the primes
theorem
Vinogradov's theorem
theorem stating that a sufficiently large odd integer is the sum of three primes
Wolstenholme's theorem
theorem
Proth's theorem
primality test for Proth numbers
Linnik's theorem
mathematical theorem
Erdős–Kac theorem
theorem
Friedlander–Iwaniec theorem
infinite prime numbers of the form a^2+b^4
Bonse's inequality
inequality relating the primorial to square of the next prime number
Lagrange's theorem
theorem in number theory
Rosser's theorem
theorem
Brun–Titchmarsh theorem
Hardy–Ramanujan theorem
theorem in number theory
Siegel–Walfisz theorem