8/17/2019 Puzzles Inductis
1/2
There are 25 horses and u need to find out the minm no of races
in which u can select the
three fastest....
The coditions
1. U have no timing device
2. U have 2 race 5 horses at a time...
He was basically looking for the approach.. and not the exact
answer... i was not able to
crack it completely ... the conversation went for about ! mins
.... i managedsomething ..he gave a lot of hints in between... that
was the first round... i got a call after
say hours saying that i have cleraed the 1 st round and aws told
the time for the 2nd
round....
"ound 2.. #u$$le.... There are 5 guys %&'&(&) and *
and they need to distribute 1!!rupees among themselves..
"ules for distribution.. 1. They will get a turn to distribute
in the order %+* i.e a being thefirst and * being the last.
2.The distribution gets accepted if u have more no. of people
accepting the distri than the
no of people re,ecting it... -ts not necessary that u need to
give something to everybody..
. -f ones distribution gets re,ected than he is out of the next
distribution..
/ow the 0uestion is wat would be the distribution of %
that it definitely gets accepted...itshould be an optimum
solution...optimum being % getting the
highest obviously one who distributes would want the
highest.....
"ound ++
/o pu$$les ..... He asked me how would u find out the
total of no cars in a city3333 heasked me to assume some nos and
come up with a logical formula ...he asked me to relate
iet with population......
He asked me a lot of hr kinda 0uestions... why do u want to ,oin
us3 how would u addvalue to the organisation and stuff.....
8/17/2019 Puzzles Inductis
2/2
4or those who havent yet worked out the problem& here is
what i think should be the
answers T6 TH* %'67* #U889*: #ost /o. 12
1. Horces and "aces; minimum < races ar re0uired.2. % keeps
=> "s. himself gives and gives "e. 1 each to ( and *.
)etailed :olution for Horse #u$$le;
)ivide the set of 25 horses into 5 non+overlapping sets of 5
horses each. Have a race each
for all the horses in each set. This makes it a total of 5
races& one for each set.
/ow& have a race for the winners of each of the
previous 5 races. This makes it a total of
? races.
6bserve the position of each horse in the ?th race and
correspondingly number the sets.i.e. the set of the winner of ?th
race will be said to be set no. 1 while the set of the loser
of
the ?th race will be said to be set no. 5.
/ow& possible candidates for the first three positions
exclude the followings;
1. %ny horse from set or set 5.2. %ny horse except the winner
from set &.
. %ny horse except the winner and the 2nd position from set
2.
. %ny horse except the winner& 2nd position and rd position
from set 1.
:o now we have ? candidates for top positions. However& we
know that the winner of
set 1 is the fastest horse in the whole group of 25 sets.
:o now we have 5 candidates for the second and third position.
@hat better way to find
out whos who than to have a race of these 5 horses. "ace them
and this will solve our
problem in ,ust < races.
http;AAwww.pagalguy.comAforumA0uantitative+0uestions+and+answersA2?!+pu$$le+
5.htmlBpost>
