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?
Two fathers and two sons went fishing one day. They were there the whole day and only caught 3 fish. One father said, that is enough for all of us, we will have one each. How can this be possible?
You have a square. What you have to do is cut and reassemble the square such that you create a Red Cross sign that has the same volume as that of the square.
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.