1999 AHSME Problems/Problem 30
From AoPSWiki
Problem
The number of ordered pairs of integers 
for which 
and
is equal to
Solution
We recall the factorization (see elementary symmetric sums)
Setting 
, we have that either 
or 
(by the Trivial Inequality). Thus, there are 
solutions satisfying .
See also
| 1999 AHSME (Problems) | ||
| Preceded by Problem 29 | Followed by Last problem | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
