Browse · MATH
Printjmc
number theory intermediate
Problem
Compute .
Solution
We begin by breaking down and into prime factors. Thus we are looking for To build the greatest common divisor of two integers with known prime factors, we take the smaller power of each prime:
Final answer
225