Follow the rules.
=> Each digit should be used only once.
=> You can only use addition.
=> For making a number, two single digits can be combined (for example, 4 and 2 can be combined to form 42 or 24)
=> A fraction can also be made by combining the two single digits (for example, 4 and 2 can be combined to form 4/2 or 2/4)
There are three light switches outside a room. One of the switches is connected to a light bulb inside the room.
Each of the three switches can be either 'ON' or 'OFF'.
You are allowed to set each switch the way you want it and then enter the room(note: you can enter the room only once)
Your task is to then determine which switch controls the bulb?
In a particular village, only two barbershops exist.
The first shop has a handsome barber with a neat haircut who is handsomely dressed in clean clothes and is extremely humble with his body language. The place is clean and looks hygienic.
In the second shop, you can find a barber with shabby clothing. His hairs are weirdly cut and his clothes still have the stains from last night's dinner. The place is not clean as well and reeks a bit.
You visit the village for the first time and decide to get your haircut. Which barbershop will you like to go for that and why?
10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?
We have four gears with below features=> Both Gear A and D has 60 teeth=> Gear B has 40 teeth=> Gear C has 20 teeth=> Every two minutes, Gear B makes 25 full turns.What is the relative speed of Gear A and Gear B?
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