To find the LCM, we factor each number into primes. The factorization of 6 is 2 × 3, of 8 is 2³ and of 9 is 3². The LCM must contain the highest powers of each prime present, so it is 2³ × 3² = 8 × 9 = 72. This is the smallest number divisible by 6, 8 and 9 without remainder.
Option A:
Option A, 36, is divisible by 6 and 9 but not by 8, because 36 ÷ 8 is not an integer. Thus, it fails the requirement of being a common multiple of all three numbers.
Option B:
Option B correctly uses the highest powers of primes appearing in the factorization of each number. By combining 2³ and 3², we ensure divisibility by 6, 8 and 9, and 72 is the least such number.
Option C:
Option C, 48, is divisible by 6 and 8 but not by 9, as 48 ÷ 9 is not an integer. Therefore, it cannot be the LCM.
Option D:
Option D, 54, is divisible by 6 and 9 but not by 8, since 54 ÷ 8 is not a whole number. It is a common multiple of only two of the three numbers.
Comment Your Answer
Please login to comment your answer.
Sign In
Sign Up
Answers commented by others
No answers commented yet. Be the first to comment!