Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Use Euclid's division method to find the HCF of and . Then write each number as the HCF times another number.
The largest equal size that fits exactly into some amounts is their HCF. The first time things happen together again is the LCM of their times. With remainders, take them away first (HCF) or add one to the LCM. Euclid's method: gives HCF HCF.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. .
Step 2. .
Step 3. .
Step 4. . The last divisor is .
Step 5. Check. and , and and have no common factor.
Answer: the HCF is .
Log in to join the discussion.
Loading…