You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
The two towns are exactly 100 km apart. John leaves City A driving at 30 km/hr and Jacob leaves City B half an hour later driving at 60 km/hr. Who will be closer to City A when they meet?
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?