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?
After teaching his class all about Roman numerals (X = 10, IX=9 and so on) the teacher asked his class to draw a single continuous line and turn IX into 6. The teacher's only stipulation was that the pen could not be lifted from the paper until the line was complete.
An equation has been laid down using a few matchsticks. However, as you can see, the equation is not correct. Can you correct the equation if you are allowed to add or remove 5 matchsticks?