**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\).

| | | | | created: 2019-03-10 20:09:46 | modified: 2019-03-10 20:15:37 | by: *bookofproofs*

## 1.**Proof**: *(related to "Fundamental Theorem of Arithmetic")*

(none)

(none)

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint

© 2018 Powered by BooOfProofs, All rights reserved.

© 2018 Powered by BooOfProofs, All rights reserved.