Académique Documents
Professionnel Documents
Culture Documents
A B
Q R
Minimum ratio between Sboat and Scyclist will be when ratio of distance between AB by boat & by cycle is
minimum, and that will be when AB is parallel to QR, and required ratio will be AB/(AP+PB) = ½.
14. In a party with 1982 persons, among any group of four there is at least one person who knows each of the
other three. What is the minimum no. of people in the party who know everyone else?
Ans. Only three person may not know others, hence at least 1979 people know every one else. Group of any four
persons would involve all the various combinations, hence even if there are just 4 people not knowing
everyone, condition will not be satisfied.
15. A chord PQ is drawn on a circle. If the length of PQ is equal to the radius of the circle, then what is the
probability that any line drawn at random from point P through the circle is smaller than PQ
A. 1/2 B. 1/3 C. 2/3 D. 3/5.
Ans. Question is same as probability of drawing a cord random in the circle of length less than or equal to radius
asked in previous 20 questions. Answer is 1/3.
16. Between 2 station the first, second and the third class fares were fixed in the ratio 8:6:3, but afterwards the
first class were reduced by 1/6 and second class by 1/12. In a year no. of first second and third class passenger
were in ratio 9:12:26 and the money at the booking counter was 1326. How much was paid by the first class
passenger?
A. 320 B. 390 C.420 D. None. Of these.
Ans. Since revenue = number × fare, we can directly multiply ratio terms. Thus ratio of revenue from three
classes = 8×5/6×9:6×11/12×12:3×26 = 60:66:78 = 10:11:13. The first class passengers paid 1326×10/34 =
390, hence (B).
17. A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one,
and a blue one, so that each box contains at least one card. A member of the audience selects two of the three
boxes, chooses one card from each, and announces the sum of the numbers on the chosen cards. Given this
sum, the magician identifies the box from which no card has been chosen. How many ways are there to put all
the cards into the boxes so that this trick always works?
(Two ways are considered different if at least one card is put into a different box.)
Ans. Only way to distribute cards is multiples of 3 in one box, one more than multiples of 3 in second, and 2 more
than multiples of 3 in third. This way he can distributes cards in 6 ways (3!).
18. On a circle are marked 999 points. How many ways are there to assign to each point one of the letters A, B, or
C, so that on the arc between any two points marked with the same letter, there are an even number of letters
differing from these two?
Ans. Since the rule applies to every letter, they have to be in order A-B-C-A-B-C… or A-C-B-A-C-B…Thus only
two ways.
19. On a train are riding 175 passengers and 2 conductors. Each passenger buys a ticket only after the third time
she is asked to do so. The conductors take turns asking a passenger who does not already have a ticket to buy
one, doing so until all passengers have bought tickets. How many tickets can the conductor who goes first be
sure to sell?
Ans. When conductors take turn to ask for tickets, first conductor will ask 88 and second 87 in first round. On
second round this numbers will interchange. On third asking, when every passenger will buy tickets, first
conductor will be able to sell 88 tickets. Also if it is that first conductor asks every passenger once before
second conductor starts, first conductor will be able to sell 175 tickets on his second round. Question seems to
be incomplete or not worded well.
20. Around a table are seated representatives of n countries (n greater than or equal to 2), such that if two
representatives are from the same country, their neighbors on the right are from two different countries.
Determine, for each n, the maximum number of representatives.
21. 98 points are given on a circle. Maria and Joe take turns drawing a segment between two of the points which
have not yet been joined by a segment. The game ends when each point has been used as the endpoint of a
segment at least once. The winner is the player who draws the last segment. If Joe goes first, who has a
winning strategy?
Ans. Total segments that can be drawn are 98C2 = 97*49=4753. Since odd number, Joe has the winning chances.
22. A computer screen shows a 98 * 98 chessboard, colored in the usual way. One can select with a mouse any
rectangle with sides on the lines of the chessboard and click the mouse button: therefore, the colors in the
selected rectangle switch (black becomes white, white becomes black). Find, the minimum number of mouse
clicks needed to make the chessboard all one color.
Ans. When alternate columns are selected and switched colours, we get each row of same color, with alternate
rows of different colors. Thus we need 49 clicks to get this result. Next 49 clicks on alternate rows will get us
chess board of same color, hence 98.
23. A farmer has four straight pieces of fencing: 1, 2, 3, and 4 yards in length. What is the maximum area he can
enclose by connecting the pieces?
Ans. Cyclic quadrilateral of sides 1,2,3,4 will give the maximum area, thus area = √(s-a)(s-b)(s-c)(s-d) =
√1×2×3×4 = 2√6.
24. Somewhere in Northern Asia, group of 20 men were planning a special group suicide this year. Each of them
will be placed in a random position along a thin, 100 meter long plank of wood which is floating in the sea.
Each man is equally likely to be facing either end of the plank. At time t=0, all of them walk forward at a
slow speed of 1 meter per minute. If a man bumps into another man, the two both reverse directions. If a man
falls off the plank, he drowns. What is the longest time that must elapse till all the men have drowned?
Ans. If these 20 men are equally spaced with successive men facing alternate end, we would get the maximum
time. Say men stand at distance of 5meters beginning 2.5 from both end and the person closest to one end
facing other end. First time all 20 would bump into one another after 2.5 minutes at 5, 15,25 …meters. 5
minutes then after 2 men will be drowned, and 18 would bump in each other at 10, 20, 30… meters. 10
minutes then after 2 more will be drowned and remaining 16 would bump in each other at 15, 25, 35…
meters. Similarly progressing we get 2.5+(5+10+15+20+..+50) = 552.5 minutes.
25. I have chosen a number from 1 to 144, inclusive. You may pick a subset (1, 2, .. 144), i.e. U can frame any
subset based on AP, GP, or any other thing and then ask me whether my number is in the subset. An answer
of "yes" will cost you 2 dollars, an answer of "no" only 1-dollar. What is the smallest amount of money you
will need to be sure to find my number?
Ans. $1, since the set itself can be chosen and be sure to get your number within my set.
26. The side lengths of a triangle and the diameter of its incircle are four consecutive integers in an arithmetic
progression. Find all such triangles.
Ans. If sides of triangle are x-1, x, x+1; semi-perimeter, s = 3x/2. Thus area = √s(s-a)(s-b)(s-c) =
√3x/2×(x+2)/2×x/2×(x-2)/2 = x/4×√3(x2-4). Also r = ∆/s = 1/2√3×√(x2-4). Now diameter of in-circle must be
less than the smallest side, therefore dia should be x-2. (x-2)/2 = 1/2√3×√(x+2)(x-2) ∴ squaring, we get
3(x-2)2 =(x-2)(x+2) ∴ 3x-6 = x+2 or x=8. Thus sides should be 7, 8, 9 and diameter of incircle should be 6.
Since we get a simple equation for x, there is only one such triangle.
27. A 10-digit number is said to be interesting if its digits are all distinct and it is a multiple of 11111. How many
interesting integers are there?