Fundamental theorem of arithmetic
In mathematics, and in particular number theory, the fundamental theorem of arithmetic or unique factorization theorem is the statement that every positive integer greater than 1 is either a prime number or can be written as a product of prime numbers. Furthermore this factorization is unique except for the order. For instance, we can write
Related Topics:
Mathematics - Number theory - Integer - Prime number
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
:6936 = 23 · 3 · 172 or 1200 = 24 · 3 · 52
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
and there are no other possible factorizations of 6936 or 1200 into prime numbers, if we ignore the ordering of the factors.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
To make the theorem work even for the number 1, we can think of 1 as being the product of zero prime numbers (see empty product).
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | Applications |
| ► | Proof |
| ► | See also |
| ► | References |
| ► | External links |
~ What's Hot ~
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.