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?
A man has eighty-one cows ( numbered 1,2,3...81 as such). The beauty is that cow no. 1 gives 1ltr of milk, cow no. 2 gives 2ltrs of milk and so on. The man wants to equally distribute the cows among his nine sons so that each one of them gets the same quantity of milk.
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.