Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Two positive integers and have HCF and LCM . Order matters: the pair and the pair count as different.
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.
Plan. Divide out the HCF. Then and are coprime and their product is the LCM divided by the HCF.
(a) For any two positive integers, HCF LCM . So .
(b) Put and with . Then , so . Each of the four primes goes into or into , never both: ordered pairs.
(c) The sum is least when and are close. The coprime splits of are , , , , , , and . The best is , so the least .
(d) The greatest comes from : .
(e) One number divides the other only when or , because and are coprime. That removes the two pairs and , leaving .
Check. Listing every pair of divisors of with HCF and LCM gives the same 16 pairs, the same least and greatest sums and the same 14.
Log in to join the discussion.
Loading…