Two friends decide to get together; so they start riding bikes towards each other. They plan to meet halfway. Each is riding at 6 MPH. They live 36 miles apart. One of them has a pet carrier pigeon and it starts flying the instant the friends start traveling. The pigeon flies back and forth at 18 MPH between the 2 friends until the friends meet.
You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?
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 ()
In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.
I am working in a bus company. The company recently went under expansion and therefore there was not enough room for all the buses. As a result, twelve buses had to be stored outside.
If the company decides to expand the garage space by forty percent, enough space to accommodate the current buses will be created leaving enough space for twelve more buses if the need arises in future.
Can you calculate the number of buses that the company owns at present?
There is a family that live in a round house. The two parents go out for a movie and leave a babysitter to watch their son. They come back and the kid was not there. Some one kidnapped him. The maid said she was cleaning in a corner. The cook said he was making pizza. The babysitter said she was getting a board game. Who kidnapped him.
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