Debian Codegraph @

reasoning/fundamental-theorem-of-arithmetic/README

raw
1 ---------------------------------
2 Fundamental Theorem of Arithmetic
3 ---------------------------------
4
5 Every integer n > 1 can be written as a product of prime numbers, and this
6 factorization is unique up to the order of the factors. Equivalently,
7 there exist primes p1 < p2 < … < pk and positive integers e1, …, ek such that
8
9 n = p1^e1 * p2^e2 * … * pk^ek.
10
11 Existence comes from repeatedly dividing n by a prime divisor until only primes
12 remain; uniqueness follows from Euclid’s lemma (if a prime p divides ab, then
13 p divides a or b), which forces any two prime factorizations of n to use the
14 same primes with the same exponents.
15
16 For negative integers, include a factor −1; 0 and ±1 are excluded.