Difference between revisions of "1997 IMO Problems/Problem 5"
(Created page with "==Problem== Find all pairs <math>(a,b)</math> of integers <math>a,b \ge 1</math> that satisfy the equation <math>a^{b^{2}}=b^{a}</math> ==Solution== {{solution}}") |
(→Solution) |
||
(7 intermediate revisions by the same user not shown) | |||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
− | {{solution}} | + | Case 1: <math>(1 \le a \le b)</math> |
+ | |||
+ | <math>(a^{b})^{b}=b^{a}</math> | ||
+ | |||
+ | Looking at this expression since <math>b \ge a</math> then <math>a^{b} \le b</math>. | ||
+ | |||
+ | Here we look at subcase <math>a>1</math> which gives <math>a^{b}>b</math> for all <math>(1 < a \le b)</math>. This contradicts condition <math>a^{b} \le b</math>, and thus <math>a</math> can't be more than one giving the solution of <math>a=1</math> with <math>b \ge 1</math>. So we substitute the value of <math>a=1</math> into the original equation to get <math>1^{b^2}=b^{1}</math> which solves to <math>b=1</math> and our first pair <math>(a,b)=(1,1)</math> | ||
+ | |||
+ | |||
+ | Case 2: <math>(1 \le b < a)</math> | ||
+ | |||
+ | <math>a^{b^2}=b^{a}</math> | ||
+ | |||
+ | since <math>a>b</math>, then <math>b^{2}<a</math> and we multiply both sides of the equation by <math>b^{-2b^{2}}</math> to get: | ||
+ | |||
+ | <math>b^{-2b^{2}}a^{b^2}=b^{-2b^{2}}b^{a}</math> | ||
+ | |||
+ | <math>(ab^{-2})^{b^{2}}=b^{a-2b^{2}}</math> | ||
+ | |||
+ | Since <math>b^{2}<a</math>, then <math>(ab^{-2})^{b^{2}}>1</math> and <math>b^{a-2b^{2}}>0</math>. This gives <math>a-2b^{2}>1</math> | ||
+ | |||
+ | This implies that <math>a>2b^{2}</math> for <math>b>1</math> | ||
+ | |||
+ | Let <math>a=kb^{2}</math> with <math>k \in \mathbb{Z} ^{+}</math>. Since <math>a>2b^{2}</math>, then <math>k \ge 3</math> | ||
+ | |||
+ | <math>(kb^{2}b^{-2})^{b^{2}}=b^{kb^{2}-2b^{2}}</math> | ||
+ | |||
+ | <math>k^{b^{2}}=b^{(k-2)b^{2}}</math> | ||
+ | |||
+ | <math>k=b^{k-2}</math>, which gives <math>b \ge 2</math> | ||
+ | |||
+ | subcase <math>k=3</math>: | ||
+ | |||
+ | <math>3=b^{3-2}=b</math> and <math>a=kb^{2}=(3)(3)^{2}=27</math>. which provides 2nd pair <math>(a,b)=(27,3)</math> | ||
+ | |||
+ | subcase <math>k=4</math>: | ||
+ | |||
+ | <math>4=b^{4-2}=b^{2}</math>, thus <math>b=2</math> and <math>a=kb^{2}=(4)(2)^{2}=16</math>. which provides 3rd pair <math>(a,b)=(16,2)</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 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> | ||
+ | |||
+ | ~ Tomas Diaz. orders@tomasdiaz.com | ||
+ | |||
+ | {{alternate solutions}} | ||
+ | |||
+ | ==See Also== | ||
+ | |||
+ | {{IMO box|year=1997|num-b=4|num-a=6}} | ||
+ | [[Category:Olympiad Geometry Problems]] | ||
+ | [[Category:3D Geometry Problems]] |
Latest revision as of 00:01, 17 November 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. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
1997 IMO (Problems) • Resources | ||
Preceded by Problem 4 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
All IMO Problems and Solutions |