The London racetrack needs to submit its top three horses to the Kentucky Derby next month in order to compete for a prize. However in a recent electrical storm, all the racetrack's previous race history was erased such that no one knows the previous times of any of the horses. To make matters worse, each horse looks identical and it is impossible to remember which ones were the fastest.
London racetrack is home to 25 horses, but their track can only race 5 horses at a time. What is the fewest number of races that can be conducted in order to determine the 3 fastest horses?
Comments
Solid puzzle. It should be mentioned that, at the London racetrack, you don't actually time each horse. Each time you race 5 horses, you get their relative ranking (who came 1st, 2nd, 3rd, 4th, and 5th) and no other information.
Isn't this this doable with 6 races? We divide the 25 horses into groups of 5 (= 5 races) and then we arrange the 6th race with the 5 winners competing. Therefore on the 1st, 2nd and 3rd place will be the three fastest horses from the pack.
Sorry, I rushed the answer. I was not considering the race with the 3 fastest horses in the lineup.
3
divide into 5 groups equally race them => then make 5 groups of the containing three winning horses from each group. the all the first rankers out , race thm , the winner is the fastest. and the last and second last are slower then the 2nd and 3rd so they and their counterpart group is also out. then the horse which came 2nd , in its group the third one will be out because the best is 2nd , the 2nd is 3rd overall and so the 3rd one doesnt stand a chance. the group with 3rd ranker , its group is eradicated except him so you are left with five horses. race them , the winner is 2nd fastest and the 2nd one is 3rd fastest