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:

    “There can be a fundamental gulf of gracelessness in a human heart which neither our love nor our courage can bridge.”
    —Patrick, Mrs. Campbell (1865–1940)

    “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)

    “‘Tis no extravagant arithmetic to say, that for every ten jokes,—thou hast got an hundred enemies; and till thou hast gone on, and raised a swarm of wasps about thine ears, and art half stung to death by them, thou wilt never be convinced it is so.”
    —Laurence Sterne (1713–1768)