1972 USAMO Problems/Problem 1
Problem
The symbols
and
denote the greatest common divisor and least common multiple, respectively, of the positive integers
. For example,
and
. Prove that
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1972 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||