| word looked up : | home / archive |
Fundamental theorem of arithmetic : Fundamental Theorem of ArithmeticThe fundamental theorem of arithmetic is the statement that every positive integer can be written as a product of prime numbers in a unique way. For instance, we can write
and there are no other such factorizations of 6936 or 1200 into prime numbers, except for reorderings of the above factors. To make the theorem work even for the number 1, we think of 1 as being the product of zero prime numbers.
ApplicationsEssentially, the theorem establishes the importance of prime numbers: they are the "basic building blocks" of the positive integers in that every positive integer can be put together from primes in a unique fashion. Knowing the prime number factorization of a number gives complete knowledge about all factors of that number. For instance, the above factorization of 6936 tells us that the positive factors of 6936 are of the form
Once the prime factorizations of two numbers are known, their greatest common divisor and least common multiple can be found quickly. For instance, from the above we see that the greatest common divisor of 6936 and 1200 is 23 · 3 = 24. However if the prime factorizations are not known, the use of Euclid's algorithm generally requires much less calculation than factoring the two numbers. The fundamental theorem ensures that additive and multiplicative arithmetic functions are completely determined by their values on the powers of prime numbers.
ProofThe proof consists of two parts: first, we have to show that every number can indeed be written as a product of primes; then we have to show that any two such representations are essentially the same. Suppose there were a positive integer which can not be written as a product of primes. Then there must be a smallest such number, let's call it n. This number n cannot be 1, because of our convention above. It cannot be a prime number either, since any prime number is a product of a single prime, itself. So n = ab where both a and b are positive integers smaller than n. Since n was the smallest number for which the theorem fails, both a and b can be written as products of primes. But then n = ab can be written as a product of primes as well, a contradiction. The uniqueness part of the proof hinges on the following fact: if a prime number p divides a product ab, then it divides a or it divides b (Proof: if p doesn't divide a, then p and a are relatively prime and Bézout's identity yields integers x and y such that px + ay = 1. Multiplying with b yields pbx + aby = b. Both summands of the left-hand side are divisible by p, so the right-hand side is also divisible by p.) Now take two products of primes which are equal. Take any prime p from the first product. It divides the first product, and hence also the second. By the above fact, p must then divide at least one factor in the second product. But the factors are all primes themselves, so p must actually be equal to one of the factors of the second product. So we can cancel p from both products. Continuing in this fashion, we eventually see that the prime factors of the two products must match up precisely. Ned Land, ayant déjà pêché dans les mers arctiques,
l'admirions pour la première/re.html">re fois.
Dans l'atmosphère, vers l'horizon du sud, s'étendait une bande blanche
« ice-blinck ». Quelque épais que soient les nuages, ils ne/ne.html">ne/ne.html">ne peuvent
se/se.html">se modifiait suivant les caprices de la brume. Quelques-unes de ces
eût tracé les lignes ondulées. D'autres, semblables à d'énormes
réverbéraient les rayons du jour sur les mille facettes de leurs
suffi à la construction de toute une ville de marbre.
plus.html">Plus nous descendions au sud, plus ces îles flottantes gagnaient en
C'étaient des pétrels, des damiers, des puffins, qui nous
le cadavre d'une baleine, venaient s'y reposer et piquaient de coups de
tint souvent sur la plate-forme. Il observait avec attention ces
disait-il que dans ces mers polaires interdites à l'homme, il était là
ne parlait pas. Il restait immobile, ne revenant à lui que lorsque ses
_Nautilus_ avec une adresse consommée, il évitait habilement le choc de
milles sur une hauteur qui variait de soixante-dix à quatre-vingts
soixantième degré de latitude, toute passe avait disparu. Mais le
ouverture par laquelle il se glissait audacieusement, sachant bien,
toutes ces glaces, classées, suivant leur forme ou leur grandeur, avec
ou champs unis et sans limites, drift-ice ou glaces. All is still licensed under the GNU FDL.
|
|
|||||