A thief is convicted in Mexico. He gets the death penalty. The judge allows him to say the last sentence to determine how the penalty will be carried out. If the thief lies, he will be hanged, if he speaks the truth he will be beheaded. The thief tells the last sentence and to everybody's surprise some minutes later he is set free because the judge cannot determine his penalty. What did the thief say?
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
The first person saw the bridge step on it and crossed,
the second person saw the bridge did not step on it but crossed,
the third person did not see the bridge did not step on it but crossed.
Who are these people?
You walk into an old horror house. It has no power or plumbing. Once inside, you see three doors. Each door has a number on it. Behind each door is a way for you to die. Behind door number one, you die by getting eaten by a lion. Behind door number two, you die by getting murdered. Behind door number three, you die by an electric chair. You can’t turn back, so you have to go through a door. Which door do you go through?
He digs out tiny caves and stores gold and silver in them. He also built bridges of silver and made crowns of gold. They are the smallest you could imagine. Sooner or later everybody needs his help, yet many people are afraid to let him help them. Who is he?
Its something that each of us devours,
Not just us but birds, beats, trees, and flowers,
Frets iron and nibbles steel,
Toil hard stones to meal,
Exterminates king, collapse town,
And blows the mountains down.
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?