Jim and Sarah are in a long-distance relationship. Jim buys an engagement ring for Sarah and wants to mail it to her. Unfortunately, the only way to ensure the ring will be received is to place a lock on the package. Jim has locks and Sarah has locks, but neither has keys for each other’s locks. How can they make sure the ring isn’t stolen?
A non-stop marathon is the shared favourite sport of three brothers.
*The oldest one is fat and short and trudges slowly on.
*The middle brother's tall and slim and keeps a steady pace.
*The youngest runs just like the wind, speeding through the race.
"He is young in years, we let him run!" the other two brothers explained, "'because though he is surely number one, he is second, in a way." Why is it?
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 ?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
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.
