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 man is trapped in a room. The room has only two possible exits doors. Through the first door there is a room constructed from magnifying glass. The blazing hot sun instantly fries anything or anyone that enters. Through the second door there is a fire-breathing dragon. How does the man escape?
The below given figure comprises of a pattern through which you can determine the missing letter. Can you push your mind to find the pattern and add the missing letter?
There are five people. One of them shot and killed one of the other five.
We know following clues:
1. Dan ran in the NY City Marathon yesterday with one of the innocent men.
2. Mike consider being a farmer before he moved to the city.
3. Jeff is a top notch computer consultant and wants to install Ben new computer next week.
4. The murderer had his leg amputated last month.
5. Ben met Jack for the first time six months ago.
6. Jack has been in seclusion since the crime.
7. Dan used to drink heavily.
8. Ben and Jeff built their last computers together.
9. The murderer is Jack's brother. They grew up together in Seattle.
Consider yourself to be a famous detective "Sherlock Homles", Can you find the killer?
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?