admin管理员组

文章数量:1613399

In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors.[3][4][5] For example,

{\displaystyle 1200=2^{4}\cdot 3^{1}\cdot 5^{2}=(2\cdot 2\cdot 2\cdot 2)\cdot 3\cdot (5\cdot 5)=5\cdot 2\cdot 5\cdot 2\cdot 3\cdot 2\cdot 2=\ldots }{\displaystyle 1200=2^{4}\cdot 3^{1}\cdot 5^{2}=(2\cdot 2\cdot 2\cdot 2)\cdot 3\cdot (5\cdot 5)=5\cdot 2\cdot 5\cdot 2\cdot 3\cdot 2\cdot 2=\ldots }
The theorem says two things about this example: first, that 1200 can be represented as a product of primes, and second, that no matter how this is done, there will always be exactly four 2s, one 3, two 5s, and no other primes in the product.

The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (for example, {\displaystyle 12=2\cdot 6=3\cdot 4}{\displaystyle 12=2\cdot 6=3\cdot 4}).

This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, then factorization into primes would not be unique; for example, {\displaystyle 2=2\cdot 1=2\cdot 1\cdot 1=\ldots }{\displaystyle 2=2\cdot 1=2\cdot 1\cdot 1=\ldots }

This theorem generalizes to other algebraic structures, in particular to polynomial rings over a field. These structures are called unique factorization domains.

Contents
1 Euclid’s original version
2 Applications
2.1 Canonical representation of a positive integer
2.2 Arithmetic operations
2.3 Arithmetic functions
3 Proof
3.1 Existence
3.2 Uniqueness
3.3 Uniqueness without Euclid’s lemma
4 Generalizations
5 See also

本文标签： fundamentaltheoremarithmetic

版权声明：本文标题：Fundamental theorem of arithmetic 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://m.elefans.com/xitong/1728642725a1167323.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。