Documente Academic
Documente Profesional
Documente Cultură
There are three Athletes (Alex, Brook and Chris) and their individual
Coaches (Murphy, Newlyn and Oakley) standing on the shore.
No Coach trusts their Athlete to be near any other Coach unless they are
also with them.
There is a boat that can hold a maximum of two persons.
How can the six people get across the river?
(Easy)
Ans :
Alex and Brook cross, Alex returns
Alex and Chris cross, Chris returns
Coaches Murphy and Newlyn cross to join their Athletes
Brook and Newlyn return
Newlyn and Oakley cross, Alex returns
* All three Coaches are across
Alex and Brook cross, Coach Oakley returns
Chris and Coach Oakley cross.
DONE!
2. One night three naughty boys stole a basket full of mangoes from a garden. They did a quick
counting and found that the fruits were less than 100 in number.
During the night, one of the boys woke up and found that the mangoes would be divided
into three equal parts if he took one for himself. So, he ate it up, then took 1/3 of the loot,
hid it separately and then slept.
Shortly after the first boy slept, the second one woke up and found that if he took one for
himself, the mangoes can be divided into three equal shares. So, he ate one, took 1/3 of the
loot, hid it separately and then slept.
Then, the third one woke up, found and did the same as the other two and slept.
The next morning, they all woke up, counted the number of mangoes and found that the
remaining mangoes again totalled one more than could be divided into three equal parts.
How many mangoes did the boys steal?
Ans: 79
3. A perfect square number from 1 to 500 is written on a plate. It appears as perfect square
number even when the plate is inverted. What is the number? (Rap fire question)
Ans : 196 / 961
4. The figure shows a square attached to another similar square cut diagonally. Can you divide the
figure into 4 equal parts.
Ans:
5. You are given 2 eggs. You have access to a 100-storey building. Eggs can be very hard or very
fragile means it may break if dropped from the first floor or may not even break if dropped
from 100th floor. Both eggs are identical. You need to figure out the highest floor of a 100storey building an egg can be dropped without breaking. Now the question is how many
drops you need to make. You are allowed to break 2 eggs in the process.
Now finding out the optimal one we can see that we could have done it in either 15 or 14 drops
only but how can we find the optimal one. From the above table we can see that the optimal one
will be needing 0 linear trials in the last step.
So we could write it as
(1+p) + (1+(p-1))+ (1+(p-2)) + .........+ (1+0) >= 100.
Let 1+p=q which is the answer we are looking for
q (q+1)/2 >=100
Solving for 100 you get q=14.
So the answer is: 14
Drop first egg from floors 14, 27, 39, 50, 60, 69, 77, 84, 90, 95, 99, 100... (i.e. move up 14 then 13,
then 12 floors, etc) until it breaks (or doesn't at 100)
6. You are given with six numbers 1, 2, 3, 4, 5 and 6. You can arrange them in any order and
you can use all the four mathematics expression i.e. add, subtract, multiply and divide and
also parenthesis. The result must be 278.
There are three other rules
1) You can only use a number once.
2) It is not compulsory to use all the six numbers.
3) You can't join numbers i.e. you can't use 1, 2 and 3 as 123.
Ans : (1 + (3 + 4*5)*6)*2 (or any other possibility)
Consider this example to help understand how the system can be set up.
The arrow represents the projector. The circle represents the receiver. The
heavy black lines are mirrors. The beam passes through the middle of each
area. Eight mirrors are used.
Challenge 1: Cover all 25 areas using only seven mirrors.
Challenge 2: Cover all 25 areas such that the beam enters each area only
once and never crosses itself.
Challenge 3: With two mirrors already placed as shown in the diagram,
cover all 25 areas by adding only 6 mirrors.
Challenge 4: The shaded areas in the diagram represent solid columns that
the beam cant pass through or bounce off of. Use only 6 mirrors to cover
all 22 remaining areas.
Ans :
Challenge 1: Stopping the first line one area short of a full row saves one
mirror and changes direction the same way as the two-mirror V
arrangement. Putting the mirrors outside of the large triangle provides a
way to move from one row to a parallel row. Other solutions are possible.
Challenge 4: I found it easy to solve this one, but I often developed more
complicated solutions. This solution is pretty straightforward.
Challenge 5: This solution introduces a new mirror angle. The beam travels
through the middle of all 22 areas without leaving the large triangle. The
two straight sections near the projector and the receiver must be at the
start and end of the beam. Too many mirrors are needed to get back out of
these sections.
Ans :
INTERACTIVE PUZZLE :
Ans :
Ans :
We added the letter "B" and got these words: BLAME, ABYSS,
ZEBRA, GLOBE, and SHRUB.
Put the point of your pencil at the "0" in the upper left corner
of the checkerboard. From this starting point draw through the
center of all 64 squares using one continuous line of 21
straight strokes. You can draw horizontally or vertically but
never diagonally or obliquely. You must never touch any
square twice and never exit the checkerboard.
Furthermore, you must end your tenth stroke at the square
marked "10" and end your last stroke at the square marked
"21."
Ans :
http://www.williamarmstrong.com/brain/puzzle.html
Ans : The
two-letter prefix words are do, up, or, by, and in. The
resulting new words are shown below.
1. donor, docent, domain, dosage, doused, dowager, dogeared,
dominion, donation
On a clock
Decode these:
GTYORJOTEOUIABGT
Ans : Great Job You Got It. Write it as 4x4 matrix
Decipher
yyyy u r, yyyyy u b, i c u r y+y 4 ?
Ans : Wise you are, Wise you be, I see you are too wise for me
Ans : The series lists numbers that are flanked by two prime numbers.