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 order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
The average age of 10 members of a committee is the same as it was 4 years ago, because an old member has been replaced by a young member. Find how much younger is the new member ?
For an extra income, John decided to work at a Hotel for one hour daily. The manager offers him that they will pay him $11 after every 11 days.
However, John offered a different proposition to the manager. The offers stand as:
He will be paid just a penny on his first day.
Two pence will be paid on the second day,
Four pence will be paid on the third day.
And so on till the 11th day.
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.