Find number of positive integral pairs a , b such that
a b ∣ a 2 0 1 7 + b .
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.
How did you deduce that a^2017 divides b?? Why not a^2012 or a^729 ??
Log in to reply
I have used induction.
Log in to reply
Could you please elaborate how??
Log in to reply
@Aaghaz Mahajan – The first paragraph shows that, if a n divides b , then a n + 1 divides b , provided that 0 ≤ n ≤ 2 0 1 6 . Since it is certainly true that a 0 divides b , a 1 divides b , so a 2 divides b , so a 3 divides b , and so on. Since there is an upper limit on the allowed value of n , we deduce by induction that a 2 0 1 7 divides b .
Log in to reply
@Mark Hennings – Ok...got it. Thank you, sir.
Problem Loading...
Note Loading...
Set Loading...
If 0 ≤ n ≤ 2 0 1 6 and a n divides b , then a n + 1 divides a b , and hence a n + 1 divides a 2 0 1 7 + b . This implies that a n + 1 divides b . Since it is certainly true that a 0 = 1 divides b , we deduce that a 2 0 1 7 divides b . Thus b = a 2 0 1 7 c for some positive integer c , and we now know that a c divides 1 + c .
Since c divides 1 + c (and these two numbers are coprime), we deduce that c = 1 , and hence that a divides 2 . Thus there are 2 solutions, namely ( a , b ) = ( 1 , 1 ) and ( 2 , 2 2 0 1 7 ) .