Chapter 9 — HCF-LCM

Understanding factors means finding which whole numbers divide a given number without leaving a remainder. For example, to find factors of 12 you can try dividing 12 by 1,2,3,... and write those that give exact division: 1,2,3,4,6,12. When you find a divisor d, you also find its partner 12 ÷ d. This pairing idea helps list factors quickly.

Understanding multiples means listing numbers you get by multiplying the given number by integers: for 4 the multiples are 4, 8, 12, 16, 20, ... Multiples continue forever while factors stop at the number itself. Multiples show repeating patterns and are useful for timing and schedule problems.

Divisibility checks help save time: even numbers are divisible by 2, numbers ending in 0 or 5 by 5, sums of digits divisible by 3 give divisibility by 3, etc. These simple rules let you test factors without full division. Use these rules as a quick filter before writing down factors or multiples.

Practical connection Good number sense about factors and multiples helps in many situations: arranging objects in rows, dividing sweets into equal packets, checking if two numbers can be evenly shared, or seeing when two repeating events meet. Practice small examples to build speed: write factor pairs up to the square root of the number so you get both factors each time you find one.

Class habit Keep multiplication tables handy to list multiples fast. When asked to compare two numbers, write factors in columns or list multiples side by side to find common values. This habit reduces errors and prepares you for HCF and LCM methods where factors and multiples are central.

Definition and importance A prime number is a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself. Examples are 2, 3, 5, 7, 11 and so on. Composite numbers are greater than 1 and have more than two positive divisors; for example 8 and 12 are composite. The number 1 is neither prime nor composite.

Why primes matter Prime numbers are the basic building blocks of other numbers. Every composite number can be written as a product of prime numbers — this is called prime factorisation. For HCF and LCM, prime factorisation gives a clear and reliable method to compare numbers and extract common or complete prime parts.

How to test a number for primality For small numbers check divisibility by primes 2,3,5,7 and for somewhat larger numbers check up to the square root of the number. If none of these primes divide the number exactly, the number is prime. This reduces work because you do not need to try all numbers as divisors.

Sieve of Eratosthenes is an easy classroom method to find primes up to 100: write numbers 2 to 100, cross out multiples of 2 except 2, then cross out multiples of next uncrossed number 3, and continue with 5, 7, etc. The numbers left uncrossed are primes. Doing this gives a quick reference list and helps in prime factorisation work later.

Factor trees visualise prime factorisation. Start with a composite number, split it into two factors, and continue splitting composite factors until all branches end in primes. This tree shows clearly the prime parts and their powers, which you will use to compute HCF and LCM by comparing exponents across numbers.

HCF by listing is the most basic method and is best for small numbers. List all factors of each given number clearly in columns. Then underline or circle the factors that occur in every column. The HCF is the greatest of these common factors. This method is easy to explain in a test answer but becomes slow for larger numbers that have many factors.

HCF by prime factorisation is systematic and works well for larger or several numbers. First prime-factorise every number. Then list the prime factors with their exponents for each number. For each prime common to all numbers, take the lowest exponent (the minimum power). Multiply these common primes with their minimum exponents to get the HCF. This ensures the HCF divides each number exactly and is the largest such number common to all.

Compare the two Listing is quick for small numbers and helps develop understanding. Prime factorisation is precise and efficient for medium-size numbers or when there are three or more numbers. For class problems, show all steps of prime factorisation and line up primes so the examiner can follow your logic. If you are unsure, do both and verify that answers match; this builds confidence.

Practical consideration For three or more numbers prime factorisation tends to be less error-prone. Also, if you need the LCM later, prime factorisation gives both HCF (use minimum powers) and LCM (use maximum powers) from the same work. Always check by dividing the original numbers by your HCF to confirm no remainder is left.

Euclid's idea uses division and remainders to find the HCF quickly for two numbers. The method is faster than listing when numbers are moderate or large. It relies on the simple fact that the HCF of two numbers does not change if the larger number is replaced by its remainder when divided by the smaller.

Step-by-step Start with two numbers a and b with a ≥ b. Divide a by b to get quotient q and remainder r: a = bq + r. If r = 0 then HCF(a,b) = b. If r ≠ 0 replace a by b and b by r, and repeat the division. Continue until remainder becomes 0. The last non-zero remainder is the HCF. Write each division step neatly so that the chain is easy to follow and check.

Why it works Each remainder divides the previous divisor. All common divisors of a and b also divide r, so successive remainders preserve the common divisors and reduce the pair until the greatest common divisor appears as the final non-zero remainder.

Using with more numbers For three numbers find HCF of the first two using Euclid's method, then find HCF of that result with the third number. This pairwise use is reliable. In exams show full division steps like 84 = 36 × 2 + 12 so the teacher can follow; partial steps may lose marks. The division method is fast and good practice for higher classes where Euclid's algorithm remains an important tool.

LCM by listing means writing multiples of each number until you spot the first common one. For small numbers this visual approach helps build understanding. For example, multiples of 4 are 4,8,12,... and of 6 are 6,12,18,... so 12 is the first common multiple. Listing is good for quick checks and small classroom problems.

LCM by prime factorisation is systematic: write each number as product of prime powers. For each prime that appears in any factorisation, take the highest exponent (maximum power) that appears among the numbers. Multiply these primes with their highest powers — result is the LCM. This ensures the LCM is divisible by every number because it contains each prime to the needed maximum amount. Example: 12=2^2×3 and 18=2×3^2, highest powers are 2^2 and 3^2 → LCM = 4×9 = 36.

Division ladder (or ladder method) handles several numbers in one table. Place numbers in a row and divide by a prime that divides at least one number, writing quotients below. Continue dividing by small primes until all numbers reduce to 1. The LCM is the product of all prime divisors used in the left column. This collects the necessary prime powers conveniently for many numbers at once and is often faster than separate prime factorizations.

Choosing method For two small numbers listing often suffices. For three or more numbers or larger values use prime factorisation or ladder. Prime methods are less error-prone and give both HCF (minimum powers) and LCM (maximum powers) from the same prime lists. Always check that your LCM divides each original number.

The key relation For two positive integers a and b there is a handy identity: a × b = HCF(a,b) × LCM(a,b). This formula links the largest common divisor and the smallest common multiple. It is useful both as a computational tool and a way to check answers in exam problems.

How to apply If you can compute the HCF easily and you know the two numbers, then LCM = (a × b) ÷ HCF. For example with 12 and 18 we compute product 12×18=216, HCF=6 so LCM = 216 ÷ 6 = 36. Conversely, if LCM and one of the numbers are given along with HCF, you can find the other number by rearranging the formula.

Why it is true At the prime factor level each number is a product of primes to certain powers. HCF uses minimum exponents shared by both, while LCM uses maximum exponents present. Multiplying HCF and LCM multiplies the minimum and maximum exponents, which together give the full exponent sum needed to obtain a×b. Thus the relation follows from prime factor rules clearly.

Limits and care The neat formula applies directly for two numbers. For three or more numbers there is no single simple multiplicative identity like this; you must use pairwise methods or prime factor comparison. In exams, use this relation to verify that your HCF and LCM are consistent: compute HCF×LCM and compare with product a×b. If they match, your answers are likely correct.

Problem type and idea HCF is used when we want the largest possible equal units. Typical tasks: cutting ropes into equal longest pieces, packing objects into maximum-size identical boxes, or forming largest equal groups of students and materials so that nothing is left over. The HCF of the given quantities gives that maximum size or the number in each equal group.

How to solve Step 1: Identify all quantities that must be split equally and put their numbers. Step 2: Compute the HCF of those numbers using a suitable method (listing, prime factorisation or division). Step 3: Report the HCF as size (length, sweets per packet, etc.) and show how many groups result by dividing each quantity by the HCF. This step answers the full question and checks there is no leftover.

Examples in life Cutting three ropes of different lengths into the largest equal pieces is a direct HCF question. Packing biscuits into identical boxes without leftovers uses HCF to ensure no waste. Making teams with equal numbers from given counts of boys and girls where groups must be identical in size also uses HCF.

Practical advice Convert units first (e.g., cm and m) so that HCF makes sense. When numbers are large use Euclid’s division method for speed. After obtaining HCF, demonstrate dividing each original number by it to show exact division and to find the number of groups. Writing this division check in your answer gives clarity and helps secure marks in exams.

Problem type and idea LCM is used to find when two or more repeating events next happen at the same time. Examples include bells ringing at regular intervals, buses arriving at a stop with fixed gaps, or lamps flashing. The LCM of the intervals gives the earliest time when all events coincide again.

How to set up Step 1: Convert all intervals to the same unit (seconds, minutes, hours). Step 2: Compute the LCM using a method appropriate for the numbers (listing for small numbers, prime factorisation or ladder for larger or more numbers). Step 3: State the time when events meet and, if asked, how many times they occur in a day or hour by dividing the total time by the interval.

Visual method Drawing a timeline with marks at multiples of each interval helps students see the first common mark. This connects the idea of LCM to real pictures and makes it easier to explain the answer in words. For clocks or cycles, show the repeated cycles until they meet at the LCM point.

Examples and checks If buses come every 12 and 18 minutes, LCM(12,18) = 36 so they meet every 36 minutes. Always check by dividing the LCM by each interval to ensure exact division. For three or more intervals the ladder method gives a neat way to collect required prime powers and compute the LCM without long listing.

Read and translate Carefully read word problems to identify quantities and whether you need the largest equal share (HCF) or the earliest common time/number (LCM). Words such as "largest equal groups", "biggest identical pieces" or "equal rows" indicate HCF. Words such as "first time", "meet together" or "every" often signal LCM. Write down the numbers clearly and convert units if needed.

Choose a method For small numbers try listing factors or multiples first to build understanding. For larger numbers or three or more values use prime factorisation or the division ladder. For checking answers use the HCF×LCM relation for two numbers to ensure consistency. If a student is unsure, solving by two different methods is a good exam strategy to gain partial credit and reduce error.

Steps in an answer 1) State which operation you will use (HCF or LCM) and why. 2) Show the chosen method with neat steps: lists, prime factors or ladder. 3) Give final numerical answer and explain it in words: e.g., "36 minutes", or "14 sweets per box". 4) Verify by dividing to confirm no remainder for HCF or exact division for LCM.

Common mixed problems Some tasks ask both: first find largest equal groups (HCF), then find how often groups repeat in cycles (LCM). Practice such mixed questions to avoid confusion. Clear labelling of intermediate steps avoids mistakes and helps teachers award marks for method even if minor arithmetic slips occur.

Why checking matters Small mistakes in multiplication or division lose marks. Checking ensures correctness: HCF must divide each original number exactly; LCM must be divisible by each original number. For two numbers, use the product relation HCF×LCM = a×b to verify results quickly.

Common errors Students may choose highest power instead of lowest when finding HCF from prime factors; they may stop the division ladder too early; or confuse HCF with LCM in word problems. Mixing up units (minutes and seconds) or failing to convert before computing LCM is another frequent mistake. Arithmetic slips when multiplying primes also occur.

How to avoid mistakes Show full working: write prime factorisations clearly and line up the primes in columns so minima and maxima are visible. In the ladder method present each row completely and only stop when all numbers are 1. For division method show each remainder step. After finding an answer always perform a quick divisibility check: divide numbers by HCF for zero remainder, divide LCM by each original number for zero remainder.

Exam tips When short on time use the quickest method: Euclid’s division for HCF and ladder or prime factorisation for LCM. If uncertain, write the method steps even if arithmetic is incomplete — teachers award marks for correct methods. Keep a small table of primes (2,3,5,7,11,13,17,19...) for quick reference during factorisation.

Structured practice Start with simple listing tasks to build understanding: find factors of small numbers and list multiples up to a reasonable point. Then move to prime factorisation and practice factor trees until you can write prime factors confidently. After that learn Euclid’s division steps for HCF and the division ladder for LCM. Practise all three methods so you can choose the best one in an exam.

Levels of problems Level 1: Find factors, primes and HCF/LCM of small pairs. Level 2: Use prime factorisation and ladder for three numbers. Level 3: Solve mixed word problems that require reading, unit conversion and method choice. Time yourself for simple problems to build speed and then focus on accuracy for complex problems.

Exam presentation Always state which method you use and why. Write prime factorizations neatly, show division steps for Euclid’s method and draw a clear ladder for LCM. Label your final answer with units and a short sentence to make your solution clear. Partial credit is often given for correct method even if arithmetic slip occurs.

Revision tips Keep a small list of prime numbers up to 100, memorise multiplication tables up to 10×10 for speed, and practise converting units for timing problems. Regular short practice sessions (10–15 minutes daily) build fluency. Try solving the same problem by two methods to confirm answers and to learn which method is faster for different kinds of numbers.