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?
Below, you will find the mathematical proof that 10 equals 9.99999?. But is that possible or there is something wrong about it? Can you find the error?
x = 9.999999...
10x = 99.999999...
10x - x = 90
9x = 90
x = 10