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?
I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).
I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.
What is the probability that another side is also tail?
