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?
Consider all the numbers between 1 and 1 million. Among all these numbers, there is something very special about the number 8 and the number 2202. What is it?
Three fair coins are tossed in the air and they land with heads up. Can you calculate the chances that when they are tossed again, two coins will again land with heads up?