Statement
Using prime factorization, compute the greatest common divisor and the least common multiple of and .
Solution
Factor: The gcd takes each common prime with the smallest exponent: The lcm takes each prime with the largest exponent: Check: .
| tags |
Statement
Using prime factorization, compute the greatest common divisor and the least common multiple of and .
Solution
Factor: The gcd takes each common prime with the smallest exponent: The lcm takes each prime with the largest exponent: Check: .