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.
The first person saw the bridge step on it and crossed,
the second person saw the bridge did not step on it but crossed,
the third person did not see the bridge did not step on it but crossed.
Who are these people?
A fresh card pile is taken out of a box (the pile has 54 cards including 2 jokers). One joker is taken out and then the cards are shuffled for a good amount of times. After shuffling, two piles are made by dividing that one pile.
What is the possibility that one of the piles will have a card sequence from A to K in order?