1972 USAMO Problems/Problem 1
The symbols and denote the greatest common divisor and least common multiple, respectively, of the positive integers . For example, and . Prove that
As all of the values in the given equation are positive, we can invert it to get an equivalent equation:
We will now prove that both sides are equal, and that they are integers.
Consider an arbitrary prime . Let , , and be the greatest powers of that divide , , and . WLOG let .
We can now, for each of the expressions in our equation, easily determine the largest power of that divides it. In this way we will find that the largest power of that divides the left hand side is , and the largest power of that divides the right hand side is , q.e.d.
|1972 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5|
|All USAMO Problems and Solutions|