LCM and HCF
The chapter on the highest common factor and the lowest common multiple is small in appearance but wide in reach, because almost every question that talks about things meeting again, things being divided equally, or things being filled to the brim is really a question about the HCF or the LCM. In the ADRE Grade III paper these two ideas are tested through short, practical problems, and a candidate who can tell at a glance which of the two is wanted will finish the section quickly.
The highest common factor of two or more numbers is the largest number that divides each of them exactly, leaving no remainder. It is also called the greatest common divisor. The lowest common multiple is the smallest number that each of the given numbers divides exactly. For two numbers the product of the HCF and the LCM is always equal to the product of the numbers themselves, a fact that lets a candidate find one of the two when the other is known.
The HCF is found by writing each number as a product of prime factors and taking the common factors with the lowest powers. The LCM is found from the same factorisation by taking every factor, common or not, with the highest power. For example, to find the HCF and LCM of twenty-four and thirty-six, write twenty-four as two cubed times three and thirty-six as two squared times three squared; the HCF is two squared times three, which is twelve, and the LCM is two cubed times three squared, which is seventy-two. The division method, in which the numbers are divided by common primes until no common prime remains, is a faster route when the numbers are large.
Two numbers are co-prime when their highest common factor is one. Co-prime numbers need not themselves be prime; eight and fifteen are co-prime even though neither is prime, because they share no common factor other than one. The HCF of two co-prime numbers is one and their LCM is the product of the two numbers. This fact appears often in questions that ask for the least number which is exactly divisible by two given numbers.
Word problems decide which of the two ideas to use by the sense of the question. If things are to be divided into equal groups, or the largest tile that can cover a floor exactly, or the greatest number that divides several numbers leaving the same remainder, the HCF is wanted. If things meet again, or bells toll together, or runners on a circular track come together again, or a number must be exactly divisible by several numbers, the LCM is wanted. Reading the question once more before starting the calculation saves the candidate from solving the wrong problem correctly.
Remainder problems have their own small rules. To find the largest number that divides a, b and c leaving the same remainder r in each case, subtract r from each number and take the HCF of the results. To find the largest number that divides a, b and c leaving the same remainder but with the remainder unknown, take the HCF of the differences between the numbers. To find the least number which, when divided by a, b and c, leaves the same remainder r in each case, find the LCM of a, b and c and add r.
The least number which leaves remainders that are each short of the divisor by the same amount is found by taking the LCM and subtracting that common shortfall. For example, the least number which when divided by six, eight and twelve leaves a remainder of five in each case is the LCM of six, eight and twelve, which is twenty-four, plus five, giving twenty-nine. The same question with a shortfall of one is the LCM minus one. Candidates should practise both forms until the difference is automatic.
The LCM of fractions is the LCM of the numerators divided by the HCF of the denominators, and the HCF of fractions is the HCF of the numerators divided by the LCM of the denominators. These two results appear in the paper more often than candidates expect, and they are easy marks for anyone who remembers them. A whole number is treated as a fraction with denominator one when it is mixed with proper fractions.
Decimal questions are handled by first converting the decimals to fractions or by shifting the decimal point in every number by the same number of places until all the numbers are whole. The HCF or LCM is then found for the whole numbers and the decimal point is restored. For example, the HCF of 0.6 and 0.9 is found by taking the HCF of six and nine, which is three, and shifting back one place to get 0.3.
A square or cube number that must be divisible by several numbers is found by taking the LCM and then raising each prime factor to the next multiple of two for a square, or of three for a cube. The smallest square number divisible by four, six and ten is found by taking the LCM, which is sixty, writing it as two squared times three times five, and then making every exponent even, which gives two squared times three squared times five squared, that is nine hundred. The method is short once the idea of even exponents is understood.
Time, distance and calendar questions all lean on the LCM. Bells that toll at intervals of six, eight and twelve minutes toll together after the LCM of those numbers, which is twenty-four minutes. Two runners on a circular track meet again after a time equal to the LCM of the times they take for one round. The number of times the hands of a clock overlap in a day is a classic application that rewards a candidate who is comfortable with the LCM. Recognising the pattern turns a wordy question into a one-line calculation.
The most common mistakes in this chapter are worth naming. Candidates use the HCF where the question wants the LCM and the other way round, they forget to add the remainder in a remainder problem, and they take the HCF of the given numbers instead of the HCF of their differences. A second reading of the question, and a quick check that the answer is plausible, for instance that an LCM is larger than the largest number given, removes most of these errors and makes the chapter one of the safest sources of marks in the paper.
The highest common factor and the lowest common multiple are two of the most useful concepts in arithmetic, and the questions on them appear in almost every paper. The highest common factor of two or more numbers is the greatest number that divides each of them exactly, and the lowest common multiple is the smallest number that is exactly divisible by each of them. The candidate should be able to find both by the prime factorisation method and by the division method.
The prime factorisation method is the most reliable. Each number is written as a product of its prime factors, and the highest common factor is the product of the common prime factors taken with the lowest power, while the lowest common multiple is the product of all the prime factors taken with the highest power. For example, the highest common factor of twelve and eighteen is six, and the lowest common multiple is thirty-six.
The relation between the highest common factor, the lowest common multiple and the two numbers is a favourite question. The product of the two numbers equals the product of their highest common factor and their lowest common multiple. This relation is used to find the other number when one number, the highest common factor and the lowest common multiple are given. The candidate should note that the relation holds for two numbers only, and not for three or more.
The highest common factor is used in the problems on the division of a quantity into equal parts, the cutting of ropes of different lengths into equal pieces, and the finding of the greatest number that divides a set of numbers leaving the same remainder. The lowest common multiple is used in the problems on the bells that ring together, the lights that flash together, the runners who meet at the starting point, and the finding of the least number that leaves a given remainder.
The questions on the remainders need care. If a number leaves the remainder r when divided by each of a set of numbers, then the number is of the form L C M into k plus r, and the smallest such number is the L C M plus r. If a number is such that it is a few less than a multiple of each, the number is the L C M minus that few. The candidate should write the condition for each number and then combine them.
The topic also includes the fractions and the decimals. The highest common factor of two fractions is the highest common factor of the numerators divided by the lowest common multiple of the denominators, and the lowest common multiple of two fractions is the lowest common multiple of the numerators divided by the highest common factor of the denominators. These two rules are asked in the papers on the simplification and the fractions.
- The HCF is the largest number that divides each of the given numbers exactly.
- The LCM is the smallest number that each of the given numbers divides exactly.
- For two numbers, HCF times LCM equals the product of the numbers.
- Two numbers are co-prime when their HCF is one.
- Use the HCF for equal division and the LCM for things that meet again.
- For fractions, the LCM is the LCM of the numerators over the HCF of the denominators.
- The least number leaving a common shortfall is the LCM minus that shortfall.
- HCF × LCM = product of the two numbers (for two numbers).
- HCF: common prime factors with the lowest powers; LCM: all prime factors with the highest powers.
- Numbers leaving remainder r: LCM × k + r.
- HCF of fractions = HCF of numerators / LCM of denominators.
Frequently Asked Questions
How do I know whether a problem wants the HCF or the LCM?
If the question talks about dividing into equal groups or the largest measure, it wants the HCF; if it talks about meeting again, tolling together or being exactly divisible, it wants the LCM.
What is the quickest way to find the LCM of two numbers?
Write both numbers as products of prime powers and take every factor with its highest power; or use the fact that LCM equals the product of the numbers divided by their HCF.
How do I handle a remainder problem?
For the largest divisor leaving remainder r, subtract r from each number and take the HCF; for the least dividend leaving remainder r, take the LCM and add r.
What is the relation between the HCF, the LCM and two numbers?
The product of the two numbers equals the product of their HCF and their LCM.
How is the LCM found by prime factorisation?
The LCM is the product of all the prime factors taken with the highest powers.