SherlockHolmes's Profile
Expert
5839
points

Questions
2780

236

SherlockHolmes loves solving puzzles at PuzzleFry.com. I am proud PuzzleFry member and like my time invested in solving brain teasers.
• You are a prisoner sentenced to death.
The Emperor offers you a last chance to live by playing a simple game.

GAME-
He gives you 50 black marbles, 50 white marbles and 2 empty bowls.
He then says, “Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK  you will die.”

How do you divide the marbles up so that you have the greatest probability of saving your life that is choosing a WHITE marble?

View Solution
Submit Solution
• 1,262.3K views

• A very big building in which thousand monkeys are living is lighted by thousand lamps. Every lamp is connected to a unique on/off switch, which are numbered from 1 to 1000. At some moment, all lamps are switched off. But because it is becoming darker, the monkeys would like to switch on the lights. They will do this in the following way.

Monkey 1 presses all switches that are a multiple of 1.
Monkey 2 presses all switches that are a multiple of 2.
Monkey 3 presses all switches that are a multiple of 3.
Monkey 4 presses all switches that are a multiple of 4.
Etc., etc.

How many lamps are switched on after monkey 1000 pressed his switches?
And
which lamps are switched on?

View Solution
Submit Solution
• 1,258.7K views

• Substitute digits in place of letters to make the following relation true.

S T I L L
+ W I T H I N
——————–
L I M I T S

Note
The leftmost letter cant be zero in any word.
There must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter S, no other letter can be 3 and all other S in the puzzle must be 3.

View Solution
Submit Solution
• 1,259.0K views

• A rich man died. In his will, he has divided his gold coins among his 5 sons, 5 daughters and a manager.

According to his will: First give one coin to manager. 1/5th of the remaining to the elder son. Now give one coin to the manager and 1/5th of the remaining to second son and so on….. After giving coins to 5th son, divided the remaining coins among five daughters equally.

All should get full coins. Find the minimum number of coins he has?

View Solution
Submit Solution
• 1,264.9K views

• 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 ?

View Solution
Submit Solution
• 1,263.3K views

• In the middle of the confounded desert, there is the lost city of “Ash”.

To reach it, you will have to travel overland by foot from the coast. On a trek like this, each person can only carry enough rations for five days and the farthest we can travel in one day is 30 miles. Also, the city is 120 miles from the starting point.

What is the fewest number of persons, including yourself, that you will need in your Group so that you can reach the city, stay overnight, and then return to the coast without running out of supplies.
How many persons (including yourself) will you need to accomplish this mission?
View Solution
Submit Solution
• 1,274.4K views

• Fry Link street has 1000 buildings.
A sign board maker is contracted to number the houses from 1 to 1000.

How many zeroes will he need?

View Solution
Submit Solution
• 1,262.3K views

• If three babies are born every second of the day,

Then how many babies will be born in the year 2016?

Note- A bit trick is there

View Solution
Submit Solution
• 1,271.0K views

• Two players are playing Tic-Tac-Toe. (known as O and X game)

Player 1- Placed ‘X‘  in one of the corners.
No ‘O’ has been placed yet.

Where should the player 2 put his first ‘O‘ so that ‘X’ doesn’t win?

Assume- Both players are very intelligent

View Solution
Submit Solution
• 1,267.3K views