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?
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?