Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Find the smallest number that leaves a remainder of when divided by , by and by . Then find the smallest such number that is greater than .
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. Take away the remainder. The number minus is a common multiple of , and .
Step 2. LCM. , , , so LCM .
Step 3. The smallest. .
Step 4. The others. They are : The first above is .
Answer: , and above .
Log in to join the discussion.
Loading…