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?
In the city of Brain Teasers, 5% of people do not list their phone numbers. Now if we select random 100 people from the phone directory, then how many people selected will have unlisted phone numbers?