|
|
|
|
|
| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 10 Apr 2007 19:31:06 IST
|
|
|
prove that there atleast exists one prime no between n and 2n...ie.[n,2n] n=natural no.
|
|
|
|
![[Post New]](/templates/default/images/icon_minipost_new.gif) 10 Apr 2007 22:53:03 IST
|
|
|
this does not hold for n=1 isn't it
|
nobody is wrong
even a stopped clock is right twice a day |
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) 10 Apr 2007 22:58:17 IST
|
|
|
It does, pink. The question is between n and 2n, both inclusive. This seems like a complicated question -- quite outside the scope of the IIT. Maybe you can decipher Ramanujan's proof for it? (It is known as "Bertrand's Postulate")
|
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) 11 Apr 2007 11:45:43 IST
|
|
|
thanks.....
|
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
|
|
|
|
|