There are two answers 11 and 7
On Thu, Mar 31, 2011 at 12:23 PM, Abhishek Sharma <[email protected]>wrote: > @sourabh: could u please elaborate how u came to that conclusion. > Dave's logic seems to be right.. > > On Thu, Mar 31, 2011 at 11:00 AM, sourabh jakhar > <[email protected]>wrote: > >> answer is 6 races >> >> >> >> On Mon, Mar 28, 2011 at 11:53 PM, Dave <[email protected]> wrote: >> >>> 7 races. >>> >>> For the first five races, divide the horses into groups of five and >>> record the win, place, and show finishers of each race. >>> >>> For the sixth race, run the winners of the first five races. >>> >>> Now, only six horses remain in contention for the fastest three: >>> The winner of the sixth race and the place and show horses of his >>> first race, >>> The place horse in the sixth race and the place horse in his first >>> race. >>> The show horse in the sixth race. >>> Three of these horses are known to be faster than all other horses. >>> >>> The winner of the sixth race is known to be the fastest horse. Run the >>> other five contenders in race 7 and choose the fastest two. >>> >>> Dave >>> >>> On Mar 28, 2:54 am, Lavesh Rawat <[email protected]> wrote: >>> > *Horse Race Problem Solution* >>> > * >>> > *Ok, so there are 25 horses and the race track only allows 5 horses to >>> race >>> > at a given time. Given that there is no stop watch available your task >>> is to >>> > determine the fastest 3 horses. Assume that each horses speed is >>> constant in >>> > different races, what is the minimum number of races to determine the >>> > fastest 3? >>> > >>> > Update Your Answers at : Click >>> > Here< >>> http://dailybrainteaser.blogspot.com/2011/03/28march.html?lavesh=lavesh> >>> > >>> > Solution: >>> > Will be updated after 1 day >>> > >>> > -- >>> > >>> > "Never explain yourself. Your friends don’t need it >>> and >>> > your enemies won’t believe it" . >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> SOURABH JAKHAR,(CSE)(3 year) >> ROOM NO 167 , >> TILAK,HOSTEL >> 'MNNIT ALLAHABAD >> >> The Law of Win says, "Let's not do it your way or my way; let's do it the >> best way." >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 http://manishpathak-mobile.blogspot.com/ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
