Difference between revisions of "1972 USAMO Problems/Problem 1"
m (→Solution) |
|||
| Line 12: | Line 12: | ||
WLOG let <math>\alpha \leq \beta \leq \gamma</math>. | WLOG let <math>\alpha \leq \beta \leq \gamma</math>. | ||
| − | We can now, for each of the expressions in our equation, easily determine the largest power of <math>p</math> that divides it. In this way we will find that the largest power of <math>p</math> that divides the left hand side is <math>\beta+\gamma+\gamma-2\gamma = \beta</math>, and the largest power of <math>p</math> that divides the right hand side is <math>\alpha + \beta + \alpha - 2\alpha = \beta</math> | + | We can now, for each of the expressions in our equation, easily determine the largest power of <math>p</math> that divides it. In this way we will find that the largest power of <math>p</math> that divides the left hand side is <math>\beta+\gamma+\gamma-2\gamma = \beta</math>, and the largest power of <math>p</math> that divides the right hand side is <math>\alpha + \beta + \alpha - 2\alpha = \beta</math>. <math>\blacksquare</math> |
==See also== | ==See also== | ||
Revision as of 14:49, 11 February 2009
Problem
The symbols 
and ![$[a,b,\ldots, g]$](http://latex.artofproblemsolving.com/a/4/3/a435cfa873528fda8011ab1fee0f179f1233b4d5.png)
denote the greatest common divisor and least common multiple, respectively, of the positive integers 
. For example, 
and ![$[6,15]=30$](http://latex.artofproblemsolving.com/c/e/6/ce61f21da055164e6c4aa95b4ac1c682bb8075a7.png)
. Prove that
![$\frac{[a,b,c]^2}{[a,b][b,c][c,a]}=\frac{(a,b,c)^2}{(a,b)(b,c)(c,a)}$](http://latex.artofproblemsolving.com/a/3/7/a3797d87dfc7855e74fd6a01e4f48819256cecb4.png)
.Solution
As all of the values in the given equation are positive, we can invert it to get an equivalent equation:
![$\frac{[a,b][b,c][c,a]}{[a,b,c]^2}=\frac{(a,b)(b,c)(c,a)}{(a,b,c)^2}$](http://latex.artofproblemsolving.com/e/c/d/ecd36e521e220cc8d42f8555801b6efbfad9c570.png)
.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 
. 
See also
| 1972 USAMO (Problems • Resources) | ||
| Preceded by First Question |
Followed by Problem 2 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
