A charming young lady was approached by a kind looking old woman in a restaurant. The old woman said to her, 'You look exactly like my younger daughter. Sadly she passed away a couple of months back. Could you do me a favor and say 'Goodbye, mother' with a kind smile on your face when I leave?
The young lady agreed for the same and said, 'Goodbye, mother' when the old woman left. Soon after, she got the most disengaging shock of her life.
Pronounced as 1 letter, And written with 3, 2 letters there are, and 2 only in me. I’m double, I’m single, I’m black blue and grey, I’m read from both ends, and the same either way. What am I?
100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?
You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.
Can you find out how many chocolates are there in P and Q respectively?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki
