< **1** >

### Fundamental theorem of arithmetic

The **fundamental theorem of arithmetic** states:

Every integer greater than 1 is either prime itself or is the product of prime numbers, and that, although the order of the primes in the second case is arbitrary, the primes themselves are not.

##### Examples

On a Casio *fx-82EX* calculator, you can see that

666 = 2 × 3

^{2}× 37

1014 = 2 × 3 × 13^{2}

6936 = 2^{3}× 3 × 17^{2}

## HistoryThe theorem was described by the Greek mathematician Euclid, but the first complete proof appeared in 1801 in the |