by 13, is not a multiple of 20. If we next try 6 for divisor, we is a multiple of 20, but not of 12; 6 being shall find that. 12 X 20 a measure of 12, but not of 20. For, 6 being a measure of 12, 12 is equivalent to a whole number (2); so that 6 12 is the product of 20 by is a multiple of 20. 20 6 a measure of 20, is not equivalent to a whole number; so that 12 X 20 6 6 20 which is the product of 12 by 2, is not a multiple of 12. 6 Let us now try 2 for divisor, and we shall find that 12 X 20 2 is a common multiple of 12 and 20; 2 being a common measure. For, as 2 measures 20, is equivalent to a whole number (10); 20 2 is equivalent to a whole 12 X 20 which is the product of 12 by 20, is a multiple 2 12 Again: as 2 measures 12, 2 is a multiple of 20. It thus appears that the divisor must be a common measure; and upon the principle that-the dividend remaining the same the quotient is smallest when the divisor is largest, we obtain the least common multiple of 12 and 20 when we divide 12 x 20 by 4, the greatest common measure. General demonstration.-Let x and y be any two numbers, and m their greatest common measure: to prove least common multiple of x and y. m As m is equivalent to a whole number; and x: ple of x. Again: as m is a measure of x, X, or 2, is a multi Ꮖ m m m is equivalent to a whole number; and y X or is a multiple of y. So that It is also the least common 112) be a multiple of the least. y. xy m multiple. For, if not, it must (p. xy Let be a times the least com m mon multiple, if possible: in other words, let the least common I to a whole number: so that am must measure y. And be xy am Ꮖ cause which is the product of y by, is a multiple of y, am am must be equivalent to a whole number: so that am must measure x. It thus appears that am is a common measure of x and y. But this is impossible, the greatest common measure of x and y being m. It follows, therefore, that is the least common multiple of x and y. m IOI. To find the Least Common Multiple of more than two numbers: Find, first, the least common multiple of two of the numbers; next, the least common multiple of this common multiple and a third number; then, the least common multiple of this new common multiple and a fourth number ; and so on, until all the numbers have been taken into account. The last common multiple will be the least common multiple required. EXAMPLE.-Find the least common multiple of 8, 12, 18, and 27. The least common multiple of 8 and 12 is 8 12 24; of 24 and 18, 72; and of 72 and 27, 216. So that, according to the Rule, 216 is the least common multiple required. 24 18 27 72 216 Reason of the Rule.-As 24 is a common multiple of 8 and 12, 8 and 12 are measures of 24, and therefore of 72-a multiple of 24; 18 also is a measure of 72; consequently 8, 12, and 18, being measures of 72, are measures of 216-a multiple of 72. In other words, 216 is a common multiple of 8, 12, and 18: therefore, being a multiple of 27 also, 216 is a common multiple of the four given numbers. It is also the least common multiple. For, if a smaller number than 216 were a common multiple of 8, 12, 18, and 27, this smaller number, being a multiple of 8 and of 12, would (p. 112) be a multiple of 24-the least common multiple of 8 and 12; and, being a multiple of 24 and of 18, would be a multiple of 72— the least common multiple of 24 and 18; and, being a multiple of 72 and of 27, would be a multiple of 216-the least common multiple of 72 and 27. But a smaller number than 216 cannot be a multiple of 216: neither, therefore, can a smaller number than 216 be a common multiple of 8, 12, 18, and 27. So that 216, which has been shown to be a common multiple, is the least common multiple. General Demonstration.-Let w, x, y, and z be any four numbers, and let the least common multiple of w and ≈ be a ; of a and y, b; and of b and z, c: to prove that c is the least common multiple of w, x, y, and z. X y 2 Because w and x measure a, they measure b―a multiple of a; y also measures b; consequently w, x, and y, being measures of b, measure c-a multiple of b. In other words, c is a common multiple of w, x, and y: therefore, being a multiple of z also, c is a common multiple of the four given numbers. It is also the least common multiple. For, if possible, let a smaller number than c be a common multiple of w, x, y, and z. Then, this smaller number, being a common multiple of w and x, is a multiple of a-the least common multiple of w and r; and, being a common multiple of a and y, is a multiple of b— the least common multiple of a and y; and, being a common multiple of b and z, is a multiple of c-the least common multiple of b and z. But a smaller number than c cannot be a multiple of c: neither, therefore, can a smaller number than e be a common multiple of w, x, y, and z. Consequently c, which has been proved to be a common multiple, is the least common multiple. 102. Another Rule for finding the Least Common Multiple of more than two numbers: Arrange the numbers in a horizontal row, and divide as many as possible by a common measure. Set down, in a second horizontal row, the resulting quotients and the undivided numbers. Treat this and every succeeding row in the same way as the first, and continue the process until a row of numbers shall have been obtained, of which every two are prime to each other. Then, multiply the several divisors and the numbers in the last row together, and the product will be the least common multiple required. EXAMPLE. Find the least common multiple of 50, 60, 80, 90, and 100. 10) 50 60 80 90 100 2) 5 6 8 9 IO 5) 5 3 4 9 5 3) I 3 4 9 I I 4 3. These numbers are all measured by 10. Dividing by 10, we obtain for quotients 5, 6, 8, 9, and 10. Dividing as many as possible (i.e., 6, 8, and 10) of these quotients by a common measure, 2, and bringing down the undivided numbers, we obtain 5, 3, 4, 9, and 5. Of this row of numbers, we can divide not more than two (the first and the last, or the second and the fourth) by a common measure. Dividing the first and the last by 5, and bringing down the undivided numbers, we obtain 1, 3, 4, 9, and 1. Dividing the second and the fourth of this last row of numbers by 3, and bringing down the undivided number 4,—it is obviously unnecessary to bring down the ones, we obtain 1, 4, and 3: of which numbers every two are prime to each other. So that, according to the Rule, the least common multiple required is 10X2X5X3X4X3=3,600. Reason of the Rule.-Upon the principle that (when there is no remainder) a dividend is equal to the product of the divisor by the quotient, we have— Now, the least common multiple of the first two numbers (10X5 and 10X2X3)-the greatest common measure being Io-is (10x5) X (10×2×3) ÷ 10=10×2×5×3. The least common multiple of this common multiple and the third number (10X2X4)—the greatest common measure being 10X2is (10 X 2X5 X 3) X (10 X 2 X 4) ÷ 10 X2=10X2X5X3X4. The least common multiple of this common multiple and the fourth number (10×3×3)—the greatest common measure being 10x 3-is (10×2× 5 × 3 × 4) × (10×3×3)÷10x3=10X 2×5×3×4×3. And the least common multiple of this last common multiple and the fifth number (10 × 2 × 5)—the former number being a multiple of the latter-is 10×2×5×3×4 × 3. So that (§ 101) 10×2× 5 × 3 × 4× 3 is the least common multiple of 50, 60, 80, 90, and 100. 100 10) 60 80 90 3 4 9 5 NOTE. When two numbers in the same row are related as measure and multiple, we save unnecessary trouble by rejecting the measure. Thus, rejecting 50, which measures 100, and dividing the remaining numbers by 10, we have in the second row 6, 8, 9, and 10. Dividing as many as possible (i.e., 6, 8, and 10) of the numbers in the second row by a common measure, 2, and bringing down the undivided number (9), we have in the third row 3, 4, 9, and 5. Rejecting 3, which measures 9, we find that every two of the remaining numbers are prime to one another. And we then obtain the least common multiple by multiplying 10, 2, 4, 9, and 5 together. General demonstration. Before proceeding to examine the general demonstration given below, we must understand the following two facts: I. A number which is prime to two or more others is prime to their product. II. If the division of two numbers by a common measure give quotients which are prime to each other, that common measure is the greatest common measure of the two numbers. (I.) The first of these facts is rendered intelligible by the following considerations: (a) A (composite) number is said to be resolved into its prime factors when it is resolved into two or more factors, every one of which is a prime number. The number 30, for instance, when written 3×10, is not resolved into its prime factors: for, although 3 is, 10 is not, a prime number. But 30 is resolved into its prime factors when written 3×2×5; 3, 2, and 5 being all prime numbers. (b) If two numbers, x and y, be so related to each other that no one of the prime factors of x is a factor of y, x and y are prime to one another. For, if x and y be not prime to one another, they have some common measure, m, which must be either a prime or a composite number. Now, m cannot be a prime number: for, if it were, one of the prime factors of r would be a factor of y. Neither can m be a composite number: for, if it were, it would be resolvable into two or more prime factors, each of which would measure x and y, multiples of m; so that in this case, also, one of the prime factors of x would be a factor of y. It thus appears that and y, having neither a prime nor a composite number for common measure, are prime to one another. |