Let be positive integers satisfying , with not divisible by . Find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Since 2 0 1 6 = 2 5 ∗ 3 2 ∗ 7 the equation can be written as x + y = 1 2 1 4 .
With x = 1 4 n 2 , y = 1 4 m 2 for integers 0 < m < n the equation becomes
n 1 4 + m 1 4 = 1 2 1 4 ⟹ n + m = 1 2 .
This gives us the possible pairings ( n , m ) = ( 1 1 , 1 ) , ( 1 0 , 2 ) , ( 9 , 3 ) , ( 8 , 4 ) and ( 7 , 5 ) , the only one of which has m not dividing n being ( 7 , 5 ) . Thus x + y = 1 4 ∗ ( 7 2 + 5 2 ) = 1 0 3 6 .