Archive for Problem
{ December 19, 2009 @ 12:00 am }
·
{ Problem, The Weekly Challenge }
{ }
·
{ }
You are in a room. You don’t know how you got there. There are two ways to get out. One: A door that leads to life. Two: A door that leads to death. The doors are exactly the same. There is zero difference between the two. The only thing in the room is you and two computers. One: If you ask a question it will tell you the true answer. Two: If you ask a question it will tell you the wrong answer. You only get one question. ONE!!! You don’t know which door is which, and you don’t know which computer is which. How do you get out?
{ November 8, 2009 @ 10:58 pm }
·
{ Problem }
{ }
·
{ }
What number comes next in this sequence and why:
0 10 1110 3110 132110 1113122110 ==?==
{ October 31, 2009 @ 12:28 pm }
·
{ Problem }
{ }
·
{ }
Using standard mathematical symbols, e.g. +, -, x, etc., rearrange (4) fives to equal the numbers one to ten. For example, 5/5 + 5 – 5 = 1, 5/5 + 5/5 = 2, etc.
Note : you can use decimal point (.) only once.
{ October 23, 2009 @ 11:00 pm }
·
{ Problem }
{ }
·
{ }
Below are 10 skittles in an upside-down triangle shape, can you move the skittles around such that the triangle is the correct way up? You can move any skittle left or right, but, at most, you are only allowed to move three skittles up or down!
{ October 11, 2009 @ 7:07 am }
·
{ Problem }
{ }
·
{ }
What does this equation simplify to?
(x – a) * (x – b) * (x – c) * … * (x – z) = ?
{ September 26, 2009 @ 10:36 am }
·
{ Problem }
{ }
·
{ }
In the above figure, the rectangle at the corner measures 6 cm x 12 cm. What is the area of the circle?
{ August 29, 2009 @ 6:13 pm }
·
{ Problem }
{ }
·
{ }
A large fresh water reservoir has two types of drainage system. Small pipes and large pipes. 6 large pipes, on their own, can drain the reservoir in 12 hours. 3 large pipes and 9 small pipes, at the same time, can drain the reservoir in 8 hours. How long will 5 small pipes, on their own, take to drain the reservoir?
{ August 21, 2009 @ 11:45 pm }
·
{ Problem }
{ }
·
{ }
What year comes next in this sequence:
1973 1979 1987 1993 1997 1999
{ August 17, 2009 @ 10:54 am }
·
{ Problem }
{ }
·
{ }
100 prisoners are locked up in individual cells, unable to see, speak or communicate in any way with each other. There is a central living room with a single light bulb, the bulb is initially off and no prisoner can see the light bulb from their own cell.
Every day, the warden picks a prisoner at random, and that prisoner goes to the central living room. While there, the prisoner can toggle the bulb if they wish (off to on, or on to off). At any point, any prisoner can claim that all 100 prisoners have been to the living room. If they are wrong then all 100 prisoners will locked up forever! However, if they are correct all of the prisoners are set free.
Before the random picking begins, the prisoners are allowed to discuss a plan. What is their best plan to determine when all 100 prisoners have visited the living room?
{ August 7, 2009 @ 11:00 pm }
·
{ Problem }
{ }
·
{ }
What number replaces the question mark?
« Previous entries
