# Category:Theorems about prime numbers

Here is a list of articles in the category **Theorems about prime numbers** of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Theorems about prime numbers"

The following 29 pages are in this category, out of 29 total.

### B

- Bertrand's postulate
*(computing)* - Proof of Bertrand's postulate
*(computing)* - Bonse's inequality
*(computing)* - Brun's theorem
*(computing)* - Brun–Titchmarsh theorem
*(computing)*

### C

- Chen's theorem
*(computing)*

### D

- Dirichlet's theorem on arithmetic progressions
*(computing)*

### E

- Erdős–Kac theorem
*(computing)* - Euclid's lemma
*(computing)* - Euclid's theorem
*(computing)* - Euler's criterion
*(computing)*

### F

- Fermat's little theorem
*(computing)* - Friedlander–Iwaniec theorem
*(computing)* - Fundamental theorem of arithmetic
*(computing)*

### G

- Green–Tao theorem
*(computing)*

### H

- Hardy–Ramanujan theorem
*(computing)*

### L

- Lagrange's theorem (number theory)
*(computing)* - Linnik's theorem
*(computing)* - Lucas's theorem
*(computing)*

### M

- Maier's theorem
*(computing)* - Mertens' theorems
*(computing)*

### P

- Prime number theorem
*(computing)* - Proth's theorem
*(computing)*

### R

- Rosser's theorem
*(computing)*

### S

- Siegel–Walfisz theorem
*(computing)*

### V

- Vantieghems theorem
*(computing)* - Vinogradov's theorem
*(computing)*

### W

- Wilson's theorem
*(computing)* - Wolstenholme's theorem
*(computing)*