Akbar called Birbal and asked him to draw a line on the floor. He asked Birbal to make that line smaller without erasing it. Birbal smiled and did it before Akbar could blink his eyes.
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?
How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.
By using all numbers, i.e. 123456789 and subtraction/addition, operators number 100 can be formed in many ways.
Example: 98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
But if we add a condition use of the number 32 is a must. Then there are limited solutions.
One of such solution is: 9 - 8 + 76 + 54 - 32 + 1 = 100