There are 25 horses and five tracks. There is no stop clock
and we have to find the top 5 horses in the bunch. What is
the minimum possible races ?
Answers were Sorted based on User's Feedback
Answer / x
|Is This Answer Correct ?||3 Yes||20 No|
Answer / bragaadeesh
Guys the answer is 8!!!
|Is This Answer Correct ?||2 Yes||20 No|
Answer / rj
------ * ----
= ------ * ----
=--------------- = 53130
|Is This Answer Correct ?||2 Yes||26 No|
Answer / ajay
25 horses can be grouped into 5 . like a,b,c,d,e. each group contains 5 horses. so there are 5 tracks and 5 groups so each race for every group. rank 1 horse from every group will be eligible for further and last round. the final round is for 5 horses. they are top 5.
so the minimum possible races will be 6 only.
|Is This Answer Correct ?||13 Yes||46 No|
A,B,C,D are four teams.Three guys x,y,z comment about matches between four teams , X said either A or B will win Y says A will never win Z says C or B will not win only one of them is correct then who won the match.
In a sports contest there were m medals awarded on n successive days (n > 1). 1. On the first day 1 medal and 1/7 of the remaining m - 1 medals were awarded. 2. On the second day 2 medals and 1/7 of the now remaining medals was awarded; and so on. 3. On the nth and last day, the remaining n medals were awarded. How many days did the contest last, and how many medals were awarded altogether?
1. at the recent web developers bowling match, two games weree played. kiev beat stuart in both games; also richard beat john in both games. The winner in game 1 came second in game 2. richard won game 2 and john beat stuart in game1. no player got the saame placing twice. can you determine who finished where in each game?
A clock with the hours round the face in Roman block numbers, as illustrated in the sketch fell down and the dial broke into four parts....
What are the chances that at least two out of a group of fifty people share the same birthday?
There are 10 statements written on a piece of paper: 1. At least one of statements 9 and 10 is true. 2. This either is the first true or the first false statement. 3. There are three consecutive statements, which are false. 4. The difference between the numbers of the last true and the first true statement divides the number, that is to be found. 5. The sum of the numbers of the true statements is the number, that is to be found. 6. This is not the last true statement. 7. The number of each true statement divides the number, that is to be found. 8. The number that is to be found is the percentage of true statements. 9. The number of divisors of the number, that is to be found, (apart from 1 and itself) is greater than the sum of the numbers of the true statements. 10. There are no three consecutive true statements. Find the minimal possible number?
5+3+2=151012 9+2+4=183662 8+6+3=482466 5+4+5=202504 7+2+5=?
There is a number that is 5 times the sum of its digits. What is this number? Answer is not 0.
Substitute digits for the letters to make the following subtraction problem true. S A N T A - C L A U S ----------------- X M A S Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be 3.
An apple vendor has 1000 apples and 10 empty boxes. He asks his son to place all the 1000 apples in all the 10 boxes in such a manner that if he asks for any number of apples from 1 to 1000, his son should be able to pick them in terms of boxes. How did the son place all the apples among the 10 boxes, given that any number of apples can be put in one box.
how soon can you travel down to start your new job?
Four couples are going to the movie. Each row holds eight seats. Betty and Jim don't want to sit next to Alice and Tom. Alice and Tom don't want to sit next to Gertrude and Bill. On the otherhand, Sally and Bob don't want to sit next to Betty and Jim. How can the couples arrange themselves in a row so that they all sit where they would like?