You are driving down the road in your car on a wild, stormy night, when you pass by a bus stop and you see three people waiting for the bus
An old lady looks as if she is about to die.
An old friend who once saved your life.
The perfect partner you have been dreaming about.
Knowing that there can only be one passenger in your car, whom would you choose?
One day Jenifer meets the Lion and the Tiger in the Forest of Forgetfulness. She knows that the Lion lies on Mondays, Tuesdays, and Wednesdays, and tells the truth on the other days of the week. The Tiger, on the other hand, lies on Thursdays, Fridays, and Saturdays, but tells the truth on the other days of the week. Now they make the following statements to Jenifer:
The host of a game show, offers the guest a choice of three doors. Behind one is a expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).
Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.
You cannot hear the goats from behind the doors, or in any way know which door has the prize.
The owner of a popular clothing store comes up with his own method of pricing items. A vest costs $8, socks cost $10, a tie costs $6, and a blouse costs $12. Using the owner’s method, how much would a pair of underwear cost?
The barber of Town shaves all men living in the town. No man living in the town is allowed to shave himself. The barber lives in that town. Who then shaves the barber of the town?
John: "Hi Teacher, What is your favourite movie ?".
Chemistry Teacher: "Indium Cerium Platinum Iodine Oxygen Nitrogen".
Ten seconds later... John replied I got it.
I come in different shapes and sizes.
Parts of me are curved, other parts are straight.
You can put me anywhere you like,
but there is only one right place for me.
What am I?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
