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 ?
A dead body is found outside a multi-story multinational company. The case is reported and a homicide detective is called on the crime scene.
He looks at the body and then towards the building. From the position of the body, it is evident that the victim committed suicide. He goes to the first floor of the building and then walks in the direction of the dead body, opens the window and toss a coin in the air.
He goes to second floor and again repeats the process. He keeps doing this till he is done on all the floors. Then he returns back to the floor and tells his team that it is a murder.
Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?
In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
