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?
We have arranged an array of numbers below. What you have to do is use any kind of mathematical symbol you know excluding any symbol that contains a number like cube root. You can use any amount of symbols but you have to come up with a valid equation for all of them.
A father is locked up in jail. His wife has gone bankrupt. Their male child has to sell his hotel in order to gain some money. Yet their girl child does not care and is quite happy.
Five thieves looted a bank and they ran away in a car. The bank staff informed the police and they began the search of their car in their jeep. They found them on a road and chased them eventually catching them. The light that is used to fill the number plate was broken on the thieves' car. Also, the headlights of the jeep police were not working. How were the police able to catch the thieves then?
