Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (anonymous):

Not the Fool's problem of the day, There are 25 horses. At a time only 5 horse can run in the single race. How many minimum races are required to find the top 3 fastest horses? Please explain your answer. PS: Not much difficult; I am sure that any Fool can do it in a jiffy. Enjoy!

OpenStudy (anonymous):

maybe: \[NR=C_{25}^{5}\]

OpenStudy (anonymous):

NR=number of races

OpenStudy (anonymous):

\( \binom{5} {25} = 0 \)and \(\binom{25}{5}\) is not the right answer.

OpenStudy (anonymous):

ups, my bad.

OpenStudy (anonymous):

but this way each horce would race with every other.

OpenStudy (anonymous):

all possible combinations

OpenStudy (anonymous):

Minimum no of races = 6

OpenStudy (anonymous):

Can you expalin your answer Raghu?

OpenStudy (anonymous):

In a single race 5 can run so in total we can have 5 separate races and one winner from each so in the end we have 5 winners which will race again from where we can get the top 3 fastest horses... Hope it helps...

OpenStudy (callisto):

This question is quite tricky.. @raghu04 gives the no. of min. races, but it just asks how many races. What if the top 3 fastest horses are in the same group?

OpenStudy (anonymous):

@Callisto U have a good point.... but then we can proceed like this : in each of 5 races we can eliminate last two...so in total we have 15 horses left (3 from each race).. now again 3 races can be done and top 3 can be chosen so we have 9 horses left...again two races possible Top 3 from each race will give six eligible horses however 1st from each cannot be loser so we have Top 2 fastest horses and last 4 horses can be raced again to have the last fastest horse... so intotal we can have: 11 races however i think if more brain can be involved in this many races can be clubbed.

OpenStudy (callisto):

Now, you have a point :)

OpenStudy (anonymous):

@Callisto :-)

OpenStudy (callisto):

'' 1st from each cannot be loser'' :D

OpenStudy (anonymous):

the problem is that the horse that comes last in one race, may still be fastest of all the horses that rase in other race. @raghu04

OpenStudy (anonymous):

so your method will not work

OpenStudy (callisto):

But we just select the top 3.. Assume the top 3 fastest horses are all in group 1. There are 5 horses in group 1, the last in group 1 can't be the top 3 (among the 25 horses)!

OpenStudy (hba):

To find the fastest we have to track time.

OpenStudy (callisto):

lol, time of the race isn't recorded

OpenStudy (hba):

^ How do you say that ?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!