Fundamental Theorem of Arithmetic

In number theory, the fundamental theorem of arithmetic, also called the unique factorization theorem or the unique-prime-factorization theorem, states that every integer greater than 1 is either prime itself or is the product of prime numbers, and that, although the order of the primes in the second case is arbitrary, the primes themselves are not. For example,


1200
= 2^4 \times 3^1 \times 5^2
= 3 \times 2\times 2\times 2\times 2 \times 5 \times 5
= 5 \times 2\times 3\times 2\times 5 \times 2 \times 2
=\cdots\text { etc.}
\!

The theorem is stating two things: first, that 1200 can be represented as a product of primes, and second, no matter how this is done, there will always be four 2s, one 3, two 5s, and no other primes in the product.

Read more about Fundamental Theorem Of Arithmetic:  History, Proof, Generalizations

Famous quotes containing the words fundamental, theorem and/or arithmetic:

    “What is wanted—whether this is admitted or not—is nothing less than a fundamental remolding, indeed weakening and abolition of the individual: one never tires of enumerating and indicting all that is evil and inimical, prodigal, costly, extravagant in the form individual existence has assumed hitherto, one hopes to manage more cheaply, more safely, more equitably, more uniformly if there exist only large bodies and their members.”
    —Friedrich Nietzsche (1844–1900)

    “To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
    —Albert Camus (1913–1960)

    “O! O! another stroke! that makes the third.
    He stabs me to the heart against my wish.
    If that be so, thy state of health is poor;
    But thine arithmetic is quite correct.”
    —A.E. (Alfred Edward)