Theorem: Fundamental Theorem of Arithmetic

Every natural number \(n\in\mathbb N\), \(n > 1\), can be uniquely factorized, i.e. written as a product of consecutive powers of prime numbers. \[n=p_1^{e_1}\cdot\ldots\cdot p_r^{e_r},\]

with \(r \ge 1\), and \(e_i\ge 0\).

Proofs: 1

Definitions: 1
Proofs: 2 3 4
Theorems: 5

Thank you to the contributors under CC BY-SA 4.0!