Home » Ask & Discuss » Mathematics. » Algebra « Back to Discussion
Algebra
Comments (9)

Good, you got almost all the solutions except n=29. Incidentally, I found this problem in some coaching material which is for for the Ramaiah Coaching Entrance! Coaching for an entrance for coaching for another entrance!! Life has got enormously complicated these days. The solution given was long-wiunded so I wanted to see how you guys fare.
The shortest solution is at its crux a simple application of remainder theorem.
(n+1)2 = (n+7) I + r , where I is an integer. The remainder r is a constant and is easily evaluated using Bezout's Theorem by putting n = -7. We obtain r = 36.
Hence, 
The problem reduces to finding n such that n+7|36. This happens for n=2,5,11,29
Bezout's Theorem is the application of the Remainder Theorem for the special case when the polynomial P(x) is divided by a linear polynomial (ax+b). The theorem states that the remainder is 
I think it is familiar to you in the form that the remainder when a polynomial P(x) is divided by (x-a) is P(a).
Sorry, my post is long overdue.
Ok, you must first rewrite the equation as

Now, 14b2 and 9abn are both divisible by b. Hence 9a2 must also be divisible by b
Now since gcd(a,b) = 1, b divides 9a2 means, b divides 9. Also, 9 must divide b2. The only possibility is b = 9.
Similarly you conclude that a divides 14.
So a = 1,2, 7 or 14 and b = 3.
Plugging in these you see that all the pairs (1,3), (2,3), (7,3) and (14,3) are solutions and no other solutions exist.
That's a valid question which I have failed to address. Thank you for pointing it out.
Again go back to the equation

Suppose b = 9. Then you can divide by 9 throughout and you would get
a2+14x9 = 9an
a is not a multiple of 9, but the other terms are. So you obtain a contradiction.


is an integer
such that
is also a natural number.







