For nonzero integers a and b, the integer n is a common multiple of a and b if a divides n and b divides n. We say that the positive integer m is the least common multiple of a and b, written as lcm(a, b), if
(i) m is a common multiple of a and b, and
(ii) if n is a positive common multiple of a and b, then m ≤ n.
Using ideas from Section 2.5, it can be proved that lcm(a, b) always exists. Find lcm(a, b) for
(a) a = 6, b = 14 (b) a = 10, b = 35
(c) a = 21, b = 39 (d) a = 12, b = 48
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.