| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 4 Jul 2008 19:11:46 IST
|
|
|
Since you guys are interested,
1. How many pairs of positive integers (a,b) exist such that gcd(a,b) = 1 and is an integer
2. Find all n such that is also a natural number.
|
Time wounds all heels |
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 4 Jul 2008 20:48:08 IST
|
|
|
Re:For my good friends rahul, rudra panda & Co.
|
this reply: 2 points
(with 0 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 5 Jul 2008 09:24:27 IST
|
|
|
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
|
Time wounds all heels |
this reply: 10 points
(with 2 
in 2 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 5 Jul 2008 09:55:38 IST
|
|
|
sir where have you used bezout's theorem and what does it state
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 5 Jul 2008 10:15:37 IST
|
|
|
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).
|
Time wounds all heels |
this reply: 5 points
(with 1 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 5 Jul 2008 15:54:59 IST
|
|
|
sir i could not find more solutions exept (1,3)
|
this reply: 2 points
(with 0 
in 1 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 6 Jul 2008 07:53:16 IST
|
|
|
sir can you tell me how to proceed furtherfor the first question
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 6 Jul 2008 14:24:47 IST
|
|
|
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.
|
Time wounds all heels |
this reply: 10 points
(with 2 
in 2 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 6 Jul 2008 14:33:05 IST
|
|
|
sir why cant we take b=9 as 9 should be divisible by b so 9/9=1
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 6 Jul 2008 17:38:25 IST
|
|
|
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.
|
Time wounds all heels |
this reply: 12 points
(with 2 
in 3 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|