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 ?
An evil man kidnapped someone and made them take one of two pills. One was harmless, but the other was poisonous. Whichever pill the victim took, the kidnapper took the other one. The victim took their pill with water and died. The kidnapper survived. How did the kidnapper get the harmless pill?
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?
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
Can you make the number 24 by utilizing the numbers 1, 3, 4 and 6? You must use one number only one time and you can use mathematical operation symbols anytime anywhere.
Use the numbers 2, 3, 4 and 5 and the symbols + and = to make a true equation. Conditions: Each must be used exactly once and no other numbers or symbols can be used.
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.