Difference between revisions of "1997 IMO Problems/Problem 5"
(→Solution) |
(→Solution) |
||
Line 47: | Line 47: | ||
subcase <math>k \ge 5</math>: | subcase <math>k \ge 5</math>: | ||
− | <math>k=b^{k-2}</math>, thus <math>b=k^{1/(k-2)}</math> which decreases with <math>k</math> and <math>b \to 1</math> as <math>k \to \infty</math> . From subcase <math>k=4</math>, we know that <math>b=2</math>, thus for subcase <math>k \ge 5</math>, <math>1<b<2</math>. Therefore this subcase has no solution because it contradicts the condition <math>b \ge 2</math>. | + | <math>k=b^{k-2}</math>, thus <math>b=k^{1/(k-2)}</math> which decreases with <math>k</math> and <math>b \to 1</math> as <math>k \to \infty</math> . From subcase <math>k=4</math>, we know that <math>b=2</math>, thus for subcase <math>k \ge 5</math>, <math>1<b<2</math>. Therefore this subcase has no solution because it contradicts the condition for Case 2 of <math>b \ge 2</math>. |
Final solution for all pairs is <math>(a,b)=(1,1); (27,3); (16,2)</math> | Final solution for all pairs is <math>(a,b)=(1,1); (27,3); (16,2)</math> |
Revision as of 16:45, 6 October 2023
Problem
Find all pairs of integers that satisfy the equation
Solution
Case 1:
Looking at this expression since then .
Here we look at subcase which gives for all . This contradicts condition , and thus can't be more than one giving the solution of with . So we substitute the value of into the original equation to get which solves to and our first pair
Case 2:
since , then and we multiply both sides of the equation by to get:
Since , then and . This gives
This implies that for
Let with . Since , then
, which gives
subcase :
and . which provides 2nd pair
subcase :
, thus and . which provides 3rd pair
subcase :
, thus which decreases with and as . From subcase , we know that , thus for subcase , . Therefore this subcase has no solution because it contradicts the condition for Case 2 of .
Final solution for all pairs is
~ Tomas Diaz
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.