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?
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
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
Only one colour, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki
