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?
A man died, leaving $10,000,000 for his widow, 5 sons and 4 daughters. Each daughter received an equal amount, each son received twice as much as a daughter, and the widow received three times as much as a son.
You have $100 with you and you have to buy 100 balls with it. 100 is the exact figure and you can't go below or above the numbers and you have to use the entire $100. If there is no kind of tax applied how many of each of the following balls will you be able to buy:
Green Balls costing $6
Yellow Balls costing $3
Black Balls costing $0.10
Now, how many of each must you buy to fulfil the condition given?
It's pretty hard to give up.
If you remove a part of it, you will be left with a bit.
Even if you remove another part, the bit still remains.
Remove one more and it still remains.