In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.
A merchant was able to escape the kingdom without harming the shooter. How?
John is 45 years older than his son Jacob. If you find similarities between their ages, both of their ages contain prime numbers as the digits. Also, John's age is the reverse of Jacob's age.
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?
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 ?
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.
