Difference between revisions of "2024 IMO Problems/Problem 2"
Codemaster11 (talk | contribs) |
|||
| (2 intermediate revisions by one other user not shown) | |||
| Line 5: | Line 5: | ||
==Video Solution== | ==Video Solution== | ||
https://www.youtube.com/watch?v=VXFG1t_ksfI (including motivation to derive solution) | https://www.youtube.com/watch?v=VXFG1t_ksfI (including motivation to derive solution) | ||
| + | ==Video Solution（Fermat's little theorem，In English）== | ||
| + | https://youtu.be/QTBcTtY46HI | ||
| + | ==Video Solution（Fermat's little theorem，In Chinese）== | ||
| + | https://youtu.be/8WOff2j0giY | ||
| + | |||
==See Also== | ==See Also== | ||
{{IMO box|year=2024|num-b=1|num-a=3}} | {{IMO box|year=2024|num-b=1|num-a=3}} | ||
Latest revision as of 21:21, 29 August 2024
Find all positive integer pairs 
such that there exists positive integer 
![\[\gcd (a^n+b,b^n+a)=g\]](http://latex.artofproblemsolving.com/1/f/4/1f4ed3e8276279d224eb603b60082fa40dd2e0af.png)
holds for all integer 
.
Contents
Video Solution
https://www.youtube.com/watch?v=VXFG1t_ksfI (including motivation to derive solution)
Video Solution（Fermat's little theorem，In English）
Video Solution（Fermat's little theorem，In Chinese）
See Also
| 2024 IMO (Problems) • Resources | ||
| Preceded by Problem 1 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 3 |
| All IMO Problems and Solutions | ||
