Difference between revisions of "2017 USAMO Problems/Problem 1"
Mathcounts46 (talk | contribs) (Added problem) |
m (→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Prove that there are infinitely many distinct pairs <math>(a,b)</math> of relatively prime positive integers a>1 and b>1 such that <math>a^b+b^a</math> is divisible by <math>a+b</math>. | + | Prove that there are infinitely many distinct pairs <math>(a,b)</math> of relatively prime positive 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>. |
Revision as of 18:28, 20 April 2017
Problem
Prove that there are infinitely many distinct pairs 
of relatively prime positive integers 
and 
such that 
is divisible by 
.
