Difference between revisions of "2017 USAJMO Problems/Problem 1"
Alexlikemath (talk | contribs) |
|||
(8 intermediate revisions by 2 users not shown) | |||
Line 15: | Line 15: | ||
-fatant | -fatant | ||
+ | |||
+ | ==Solution 4== | ||
+ | Let <math>a = 2x + 1</math> and <math>b = 2x-1</math>, where <math>x</math> leaves a remainder of <math>1</math> when divided by <math>4</math>.We seek to show that <math>(2x+1)^{2x-1} + (2x-1)^{2x+1} \equiv 0 \mod 4x</math> because that will show that there are infinitely many distinct pairs <math>(a,b)</math> of relatively prime integers <math>a>1</math> and <math>b>1</math> such that <math>a^b+b^a</math> is divisible by <math>a+b</math>. | ||
+ | |||
+ | Claim 1: <math>(2x+1)^{2x-1} + (2x-1)^{2x+1} \equiv 0 \mod 4</math>. | ||
+ | We have that the remainder when <math>2x+1</math> is divided by <math>4</math> is <math>3</math> and the remainder when <math>2x-1</math> is divided by <math>4</math> is always <math>1</math>. Therefore, the remainder when <math>(2x+1)^{2x-1} + (2x-1)^{2x+1}</math> is divided by <math>4</math> is always going to be <math>(-1)^{2x-1} + 1^{2x+1} = 0</math>. | ||
+ | |||
+ | Claim 2: <math>(2x+1)^{2x-1} + (2x-1)^{2x+1} \equiv 0 \mod x</math> | ||
+ | We know that <math>(2x+1) \mod x \equiv 1</math> and <math>(2x-1) \mod x \equiv 3</math>, so the remainder when <math>(2x+1)^{2x-1} + (2x-1)^{2x+1}</math> is divided by <math>4</math> is always going to be <math>(-1)^{2x-1} + 1^{2x+1} = 0</math>. | ||
+ | |||
+ | Claim 3: <math>(2x+1)^{2x-1} + (2x-1)^{2x+1} \equiv 0 \mod 4x</math> | ||
+ | Trivial given claim <math>1,2</math>. <math>\boxed{}</math> | ||
+ | |||
+ | ~AopsUser101 | ||
+ | |||
+ | ==Solution 5== | ||
+ | I claim <math>(a,b) = (2n-1,2n+1)</math>, <math>n (\in \mathbb{N}) \geq 2</math> always satisfies above conditions. | ||
+ | |||
+ | Note: We could have also substituted 2n with 2^n or 4n, 8n, ... any sequence of numbers such that they are all even. The proof will work the same. | ||
+ | |||
+ | Proof: | ||
+ | |||
+ | Since there are infinitely many integers larger than or equal to 2, there are infinitely many distinct pairs <math>(a,b)</math>. | ||
+ | |||
+ | We only need to prove: | ||
+ | |||
+ | <math>a^b+b^a \equiv 0 \pmod{a+b}</math> | ||
+ | |||
+ | We can expand <math>a^b + b^a = (2n-1)^{2n+1} + (2n+1)^{2n-1}</math> using binomial theorem. However, since <math>a + b = 2n-1 + 2n+1 = 4n</math>, all the <math>2n</math> terms (with more than 2 powers of) when evaluated modulo <math>4n</math> equal to 0, and thus can be omitted. We are left with the terms: <math>(2n+1)(2n)^1-1+(2n-1)(2n)^1+1 = 4n \cdot 2n</math>, which is divisible by <math>4n</math>. | ||
+ | |||
+ | <math>(2n-1)^{2n+1} + (2n+1)^{2n-1} \equiv (2n+1)(2n)-1+(2n-1)(2n)+1 = 4n \cdot 2n \equiv 0 \pmod{4n}</math> | ||
+ | |||
+ | The proof is complete. <math>\blacksquare</math> | ||
+ | |||
+ | -AlexLikeMath | ||
+ | |||
+ | |||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 21:40, 10 June 2020
Problem
Prove that there are infinitely many distinct pairs of relatively prime integers and such that is divisible by .
Solution 1
Let and . We see that . Therefore, we have , as desired.
(Credits to mathmaster2012)
Solution 2
Let be odd where . We have so This means that and since x is odd, or as desired.
Solution 3
Because problems such as this usually are related to expressions along the lines of , it's tempting to try these. After a few cases, we see that is convenient due to the repeated occurrence of when squared and added. We rewrite the given expressions as: After repeatedly factoring the initial equation,we can get: Expanding each of the squares, we can compute each product independently then sum them: Now we place the values back into the expression: Plugging any positive integer value for into yields a valid solution, because there is an infinite number of positive integers, there is an infinite number of distinct pairs .
-fatant
Solution 4
Let and , where leaves a remainder of when divided by .We seek to show that because that will show that there are infinitely many distinct pairs of relatively prime integers and such that is divisible by .
Claim 1: . We have that the remainder when is divided by is and the remainder when is divided by is always . Therefore, the remainder when is divided by is always going to be .
Claim 2: We know that and , so the remainder when is divided by is always going to be .
Claim 3: Trivial given claim .
~AopsUser101
Solution 5
I claim , always satisfies above conditions.
Note: We could have also substituted 2n with 2^n or 4n, 8n, ... any sequence of numbers such that they are all even. The proof will work the same.
Proof:
Since there are infinitely many integers larger than or equal to 2, there are infinitely many distinct pairs .
We only need to prove:
We can expand using binomial theorem. However, since , all the terms (with more than 2 powers of) when evaluated modulo equal to 0, and thus can be omitted. We are left with the terms: , which is divisible by .
The proof is complete.
-AlexLikeMath
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.
See also
2017 USAJMO (Problems • Resources) | ||
First Problem | Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAJMO Problems and Solutions |