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:

    This leads us to note down in our psychological chart of the mass-man of today two fundamental traits: the free expansion of his vital desires, and, therefore, of his personality; and his radical ingratitude towards all that has made possible the ease of his existence. These traits together make up the well-known psychology of the spoilt child.
    José Ortega Y Gasset (1883–1955)

    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)

    I hope I may claim in the present work to have made it probable that the laws of arithmetic are analytic judgments and consequently a priori. Arithmetic thus becomes simply a development of logic, and every proposition of arithmetic a law of logic, albeit a derivative one. To apply arithmetic in the physical sciences is to bring logic to bear on observed facts; calculation becomes deduction.
    Gottlob Frege (1848–1925)