Difference between revisions of "1982 USAMO Problems/Problem 2"
(Added a solution from https://artofproblemsolving.com/community/c6h2021650) |
Tigerzhang (talk | contribs) m |
||
Line 7: | Line 7: | ||
== Solution 1 == | == Solution 1 == | ||
− | |||
Claim Both <math>m,n</math> can not be even. | Claim Both <math>m,n</math> can not be even. | ||
Revision as of 01:48, 26 December 2020
Problem
Let with real. It is known that if ,
for , or . Determine all other pairs of integers if any, so that holds for all real numbers such that .
Solution 1
Claim Both can not be even.
Proof ,.
Since ,
by equating cofficient of on LHS and RHS ,get
.
.
So we have, and .
.
So we have .
Now since it will true for all real . So choose .
and so .
This is contradiction !! So, atlest one of must be odd. WLOG assume is odd and m is even . The cofficient of in is
The cofficient of in is .
So get
Now choose .
Since holds for all real .
We have ,.
.
Clearly holds for . Even one can say that for , .
So our answer is .
-ftheftics
See Also
1982 USAMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.