Could you please explain me how you got 6 as your answer. I
could do it in a minimum of 11 races. There has to be
atleast 5 races to select 15 horses. The 15 horses then
compete among themselves and best 9 horses are chosen. The
9 horses then run in groups of 5 and 4. From the group of
5, three horses are selected. The horse which comes third
is made to run in the next group as well. We again choose
three horses from the group. So that makes it a group of 5
fastest horses. Then run the last race by which we can
determine the three fastest horses.
MINIMUM 6 RACES REQUIRED
conduct 5 races, in each race 5 horeses
out of 5 races to select 1 horse from each race (total 5
horses selected)
conduct 6 race with selected 5 horeses
out of that select top 3 horses
I m sorry for the wrong answer I posted earlier. So the
answer is definitely not 11. At the same time Anjali, it is
not even 6. It would be wrong to assume that the horses
which came second and third in the first set of five races
cannot come second and third overall. So let me provide the
correct answer now.
We conduct the 5 races. Choose the top 3 from all the 5
races. Now conduct a race of the top horses of all the
races. Choose the top 3 of the last race. They could
probably be the top 3 of the horses. We discard the horses
which came 4th and 5th along with all the horses of their
group. Let me explain it pictorially.
The top represents the standing of the 6th race. The race
among the top horses of each group. Now we can discard all
the horses which came 4th and 5th in their respective
groups. So we are left with the top 3 horses of each
group.Now consider the horses which came 4th and 5th in the
6th race. They cannot fall in the top 3. Nor can any of
their group members. So we get rid of all the remaining
horses of group 4 and group 5. So we are left with 9 horses
to choose from.
Now consider the horse which came 3rd in the 6th race and
its group memebers. We call it group 3. Now the 2nd and 3rd
horses of group 3 cannot come even 3rd overall. Hence they
can be discarded. SO we consider only the horse which came
first(1 selected for the final race). Consider group 2. We
can discard the horse which came 3rd in the group. And we
select the horses which came 1st and 2nd( 1+2 selected for
the final race). Similarly we consider all the top three
horses from group 1. But we can safely ignore the horse
which came first overall.( 1+2+2 selected for the final
race). So we have 5 horses to choose the best two from. We
already have the horse which came 1st overall. No need to
put that in the race. So the minimum number of races
required is 7 and 11 or 6.
1 2 3 4 5
1 1 1 1 1
2 2 2 2 2
3 3 3 3 3
4 4 4 4 4
5 5 5 5 5
u c ..........v humans have invented sumtin called a stop
watch......
conduct 5 races......note the timings of the horses....&
select the top 3 :P
ps : it is no mentioned anywhere in the Q tat v r not
allowed 2 use timing devices
k...if timing devices ver not yet invented :P
1st hold 5 prelim races.....
then
1.hold a race among all the 1st place horses[of the prelims]
(let it be race x)......this will determine the fastest horse..
2.hold a race among all the 2nd place horses[of the prelims]
(let it be race y)......
3.hold a race among all the 3rd place horses[of the prelims]
(let it be race z)........
4.then hold a race among the 2nd & 3rd placed horses of race
x,1st & 2nd of race y and 1st place of race z..........this
will determine the 2nd&3rd fastest horses.....
.
. . 5+4=9..........9
v need a min of 9 races 2 determine the top 3
horses(according 2 me)
If you want best 3, then we need 11 races as Alok Chandra
said.
But ideally we no need to arrang horses for races. Race any
5 horses in each race and select first 3. Repeat this 11
times, you will get best 3.
This is for the worst case.
We will only need 7 races to get the best three out of 25.
Let us Name horses as H1, H2, H3...H25. Now,
Race 1 - H1 - H5
Race 2 - H6 - H10
Race 3 - H11 - H15
Race 4 - H16 - H20
Race 5 - H21 - H21
Let us now assume
First Rank of Race 1 - W11
Second Rank of Race 1 - W12
.
.
First Rank of Race 2 - W21
.
Third Rank of Race 2 - W23
.
.
Fifth Rank Of Race 5 - W55
Race 6 - W11 , W21 , W31, W41, W51 ( toppers from first
five races)
Race 7 - 2nd from Race 6, 3rd from Race 6, X, Y , Z where
X= 2nd winner from the team of winner of race 6
Y= 3rd winner from the team of winner of race 6
Z= 2nd winner from the team of 2nd winner of race 6
So the three best horses will be , Winner of Race 6 and
Winner and Second Winner of Race 7.
13 races in total.
It might also happen that all best 3 horses are running in
one of the 5 races all together. Therefore we will be
selecting top 3 for every race.
After 5 races-->we will have top 15 horses
+ After 3 races-->we will have top 9 horses
+ after 2 races--> we will have top 6 horses
+ after 2 races--> we will have top 4 horses
+ after 1 race--> top 3 horses
Total races = 13
using stop watch 5race is enough
(they hav not abandoned use of count down timer...dont
assume anything untill stated )
without timer
13 surabh has ansered it already
Hi everybody!
Correct answer is 7.
First conduct 5 races, top horse from each group selected.
Now conduct 1 race among these five, select top three from
these. Now discard the groups of the horses who stood 3rd,
4th and 5th in last race because no one of them can make it
to top three. Now take 2nd and 3rd horse from first group
(the group to which the first ranker belongs) and 2nd horse
from second group (the group to which 2nd ranker belongs).
Now we have total of six horses but first rank is already
decided, so we are left with five horses from these, we have
to select 2. Now conduct 1 race of these five horses and
select top 2.
Thanks for reading this long answer!
Hello Everyone!
My answer is 6
Race1: Conduct race for 5 horse(H1 to H5), The Winner is W1(say)
Race2: Conduct race for 5 horses(incuding Winner from Race1)
i.e race between W1 and H6:H9
The Winner of the Race 2 is W2 (Say)
Race 3: Conduct race for 5 horses(including winner from
Race2) i.e. Race between W2 and H10 to H13
The Winner of the Race 3 is W3 (Say)
Race 4: Conduct race for 5 horses(including winner from
Race3) i.e. Race between W3 and H14 to H17
The Winner of the Race 4 is W4 (Say)
Race 5: Conduct race for 5 horses(including winner from
Race4) i.e. Race between W4 and H18 to H21
The Winner of the Race 5 is W5 (Say)
Race 6: Conduct race for 5 horses(including winner from
Race5) i.e. Race between W5 and H22 to H25
The first coming 3 horses will be considered as best.
I think the above answer is correct... If you think so.
Please drop a mail to dinesh_ram7@hotmail.com
I calculated 8 races. Here is the logic
1. 5 races, R1 to R5 s.t. each race has 5 horses and every
horse appears in exactly one of R1 to R5. Discard 4th and
5th positioned horses. Note that 3rd positioned horses
cannot be discarded as 3rd horse of Ri may be faster than
toppers of other 4 races.
2. R6 between 1st ranked horses of races R1 to R5. Topmost
ranked horse is the fastest horse.
3. R7 between
- 2nd and 3rd toppers of R6
- 2nd position holders of those three races of R1 to
R5 whose topmost horses were ranked in top 3 in R6.
Winner of R7 is the 2nd fastest horse.
4. R8 between
- All horses except winner from R7
- 3rd position holder of the race out of R1 to R5 whose
topmost horse won R6.
Fastest horse will be 3rd fastest horse.
It should be 13
(5+3+2+2+1)- please see descriptions.
25= 5 5 5 5 5 - 5 races
select top three from each as it may possible three of any
group are best three.
3+3+3+3+3=15
now
15= 5 5 5 - 3 races
again select top three from each
3+3+3=9
9= 5 4 - 2 races
6= 5 1 - 2 races
4= 4 - 1 race
that's y (5+3+2+2+1)
An explanation as to why the answer is 7, assuming no method
to time the races:
Divide the 25 horses into groups of 5 labeled A to E. Hold 5
races, one for each group and label the horses A1, A2, etc.,
where the number designates what place the horse finished.
Hold a 6th race out of the five winners of each group, and
arbitrarily pick A1 as the winner, B1 as second place, etc.
After the 6th race, you'll have the following tree for
fastest horse:
A1
| \
A2 B1
| | \
A3 B2 C1
| | | \
A4 B3 C2 D1
.
.
.
As you can see, A1 is the fastest horse and is faster than
all the horses in the other groups since he beat their
winners, and likewise, B1 is faster than the horses in
groups C to E since he beat their winners. But we don't know
if B1 is faster than the rest of the horses in group A,
since they never raced against each other, and likewise, we
don't know if C1 is faster than the remaining horses in
group B, since they didn't race each other, etc. To
determine the 2nd fastest horse, let's hold a hypothetical
7th race between A2 and B1. There are two possible outcomes
that result in the following trees:
A1 A1
| |
B1 A2
/ | \ / |
A2 B2 C1 A3 B1
| | | | | \
A3 B3 C2 A4 B2 C1
In the first outcome (left tree), B1 has won and is the
second fastest horse. Now we need to find out which horse is
3rd fastest in an 8th race between A2, B2, and C1, since
they have never raced each other.
In the second outcome (right tree), A2 has won and is the
second fastest. Therefore, an 8th race needs to happen
between A3 and B1 to determine the 3rd fastest horse.
If you consider which horses run in the hypothetical 7th and
8th races (horses A2, A3, B1, B2, and C1), you'll notice
that only 5 horses need to race, so all 5 horses can
actually run in the 7th race to determine the 2nd and 3rd
fastest horses.
So, is it possible to find the top 3 fastest horses in only
6 races? Yes, there are certain situations where this is
possible. Take the scenario where the winner always gets to
run in the next race: the first race has 5 horses (Group F)
that haven't raced; the winner goes on to race 4 more horses
that haven't raced (Group E), and that winner gets to race 4
more (Group D), etc. until the 6th and last race (Group A).
As long as the winner from the 5th race does not finish in
1st or 2nd, then you can determine the 3 fastest horses;
otherwise, you won't be able to determine the 2nd and/or 3rd
fastest horses, since the horses in group A have not raced
any of the other horses.
Race 1(F) 2(E) 3(D) 4(C) 5(B) 6(A)
----------------------------------------------------
1st F1-. E1----->E1-._ C1. B1-. A1
2nd F2 \ E2 D1 `->E1 \ B2 \ A2
3rd F3 `->F1 D2 C2 \ B3 `->B1
. F4 E3 D3 C3 `->C1 A3
. F5 E4 D4 C4 B4 A4
Thus, to guarantee you can determine the fastest 3 horses,
you need 7 races.
Three friends divided some bullets equally. After all of
them shot 4 bullets the total number of bullets remaining is
equal to the bullets each had after division. Find the
original number divided.
A person travels on a cycle from home to church on a
straight road with wind against him. He took 4 hours to
reach there.
On the way back to the home, he took 3 hours to reach as
wind was in the same direction.
If there is no wind, how much time does he take to travel
from home to church?
There is a safe with a 5 digit number as the key. The 4th
digit is 4 greater than the second digit, while the 3rd
digit is 3 less than the 2nd digit. The 1st digit is thrice
the last digit. There are 3 pairs whose sum is 11.
Find the number.
There is a safe with a 5 digit number as the key. The 4th
digit is 4 greater than the second digit, while the 3rd
digit is 3 less than the 2nd digit. The 1st digit is thrice
the last digit. There are 3 pairs whose sum is 11.
Find the number.
The secret agent X emailed a code word to his head office.
They are "AIM DUE OAT TIE MOD". But four of these five words
are fake and only one contains the information.
The agent X also mailed a sentence as a clue - if I tell you
any one character of the code word, you would be able to
tell the number of vowels in the code word.
Can you tell which is the code word?
Six cabins numbered 1-6 consecutively, are arranged in a row
and are separated by thin dividers. These cabins must be
assigned to six staff members based on following facts.
1. Miss Shalaka's work requires her to speak on the phone
frequently throughout the day.
2. Miss Shudha prefers cabin number 5 as 5 is her lucky number.
3. Mr. Shaan and Mr. Sharma often talk to each other during
their work and prefers to have adjacent cabins.
4. Mr. Sinha, Mr. Shaan and Mr. Solanki all smoke. Miss
Shudha is allergic to smoke and must have non-smokers
adjacent to her.
5. Mr. Solanki needs silence during work.
Can you tell the cabin numbers of each of them?
Substitute digits for the letters to make the following
Division true
Y F Y
-----------
A Y | N E L L Y
| N L Y
----------------
P P L
P N H
----------
N L Y
N L Y
----------
0 0 0
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 N, no other
letter can be 3 and all other N in the puzzle must be 3.
Find the smallest number such that if its rightmost digit
is placed at its left end, the new number so formed is
precisely 50% larger than the original number.
Two people enter a race in whick you run to a point and
back. Person A runs 20 mph to and from the point. Person B
runs to the point going 10 mph and 30 mph going back.
Who came in first?
You have 13 balls which all look identical. All the balls
are the same weight except for one. Using only a balance
scale, can find the odd one out with only 3 weighings?
Is it possible to always tell if the odd one out is heavier
or lighter than the other balls?
When Alexander the Great attacked the forces of Porus, an
Indian soldier was captured by the Greeks. He had displayed
such bravery in battle, however, that the enemy offered to
let him choose how he wanted to be killed. They told
him, "If you tell a lie, you will put to the sword, and if
you tell the truth you will be hanged."
The soldier could make only one statement. He made that
statement and went free. What did he say?
What is the smallest number which when divided by 10 leaves
a remainder of 9, when divided by 9 leaves a remainder of 8,
when divided by 8 leaves a remainder of 7, when divided by 7
leaves a remainder of 6 and so on until when divided by 2
leaves a remainder of 1?
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.
There are 4 mugs placed upturned on the table. Each mug have
the same number of marbles and a statement about the number
of marbles in it. The statements are: Two or Three, One or
Four, Three or One, One or Two.
Only one of the statement is correct. How many marbles are
there under each mug?
500 men are arranged in an array of 10 rows and 50 columns
according to their heights.
Tallest among each row of all are asked to come out. And
the shortest among them is A.
Similarly after resuming them to their original positions,
the shortest among each column are asked to come out. And
the tallest among them is B.
Now who is taller A or B ?