The teacher told the student that if he told a lie then he will be expelled from school and if he told the truth then he still is expelled from school.
What can a student say to prevent his being expelled from school?
Using four sevens (7) and a one (1) create the number 100. Except for the five numerals, you can use the usual mathematical operations (+, -, x, :), root and brackets ()
I have nine bottles of wine and one of the nine bottles is poisoned.
I need to find the poisoned bottle with two facts
(1) Poison is deadly, only a sip will cost death
(2) I have two mice to do so.
John speaks the truth only once a day in a week. Below are a few hints for you:
First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".
Can you identify the day on which he speaks the truth?
Three brothers Jacob, John, and James live in Mexico City. The product of the ages of these brothers is 175. Jacob and John are twins. How old is James?
An American nightclub called 'The Coconut Grove' had a terrible fire in which over 400 people died. A simple design flaw in the building led to a high death toll. Subsequently, regulations were changed to ensure that all public buildings throughout the country eliminated this one detail, which proved deadly. What was it?
A frog is at the bottom of a 30-meter well. Each day he summons enough energy for one 3-meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well?
You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.
How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?
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?
