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?
There is a box in which distinct numbered balls have been kept. You have to pick two balls randomly from the lot.
If someone is offering you a 2 to 1 odds that the numbers will be relatively prime, for example
If the balls you picked had the numbers 6 and 13, you lose $1.
If the balls you picked had the numbers 5 and 25, you win $2.
Here is what you have to do. You have to throw a ball as hard as you can but it must return back to you even if it does not bounce at anything. Also, you have nothing attached to the ball. There is no one on the other end to catch that ball and throw it back at you.