[Show all top banners]

kapuri_kha
Replies to this thread:

More by kapuri_kha
What people are reading
Subscribers
:: Subscribe
Back to: Kurakani General Refresh page to view new replies
 Somebody Please Help
[VIEWED 3235 TIMES]
SAVE! for ease of future access.
Posted on 08-07-06 9:37 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

One of my friend asked me following puzzle..
I am thinking over it for quite a long time but not being able to find a way out..
Please somebody help me..

The puzzle is as follows:


In the old story of Rabit( R) and Tortoise (T), I say that Rabit will never meet Tortoise if Rabit starts the race after Tortoise. It doesnt matter how fast Rabit runs. He just can't meet Tortoise.
Here is my argument:

Lets say T starts some seconds earlier than R with his very slow speed and R starts to follow T with his extremely fast speed.

After certain time "t", R reaches the place where T was. But in that time, T will cover some extra distance. Again R will reach that new position after some small time "t1" but again T will have travelled some additional distance in that period. Again R will run to cover the extra distance but T will cover some more distance in that time.. it keeps on going..

R will always be busy to cover the extra distance that T has already covered.

Hence R can never meet T becase by the time R reaches the point where T was, T will have covered some additional distance.

Please somebody tell me where is the flaw in his argument.
Its killing me.
 
Posted on 08-07-06 10:03 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

Is this even a puzzle? JPT!

the statement
" R will always be busy to cover the extra distance that T has already covered. "

is false in the first place.
 
Posted on 08-07-06 10:08 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

yo riddle bujhna bahra kachya paas garnu parcha nani. Bahra paas gare pachi affai thaha huncha. For tip


(u + v)
s = -------t
2
 
Posted on 08-07-06 10:27 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

bara pani pass garnu pardaina, logic ma tyo statement mileko chaina..."R will always be busy to cover the extra distance that T has already covered." because R will NOT 'always' be busy to cover the extra distance

mathematically:
the distance between T and R will reduce gradually at t1, t2...and at tn the two will be together..and from tn+1 onwards, R will win.
 
Posted on 08-07-06 10:35 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

Hey Sajhauser,
can you please tell me the value of "n". sot that the distance covered by both will be same at "tn"
 
Posted on 08-07-06 11:06 PM     Reply [Subscribe]
Login in to Rate this Post:     0       ?    
 

depends upon the velocity....forgot the formula :) at that time distance between the T and R will be zero.
 


Please Log in! to be able to reply! If you don't have a login, please register here.

YOU CAN ALSO



IN ORDER TO POST!




Within last 30 days
Recommended Popular Threads Controvertial Threads
TPS Re-registration case still pending ..
and it begins - on Day 1 Trump will begin operations to deport millions of undocumented immigrants
I hope all the fake Nepali refugee get deported
Those who are in TPS, what’s your backup plan?
To Sajha admin
All the Qatar ailines from Nepal canceled to USA
MAGA मार्का कुरा पढेर दिमाग नखपाउनुस !
Travel Document for TPS (approved)
MAGA and all how do you feel about Trumps cabinet pick?
NOTE: The opinions here represent the opinions of the individual posters, and not of Sajha.com. It is not possible for sajha.com to monitor all the postings, since sajha.com merely seeks to provide a cyber location for discussing ideas and concerns related to Nepal and the Nepalis. Please send an email to admin@sajha.com using a valid email address if you want any posting to be considered for deletion. Your request will be handled on a one to one basis. Sajha.com is a service please don't abuse it. - Thanks.

Sajha.com Privacy Policy

Like us in Facebook!

↑ Back to Top
free counters