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?
A generous owner of a company decided to give a bonus of $45 to every man and $60 to every woman on his birthday. But only one-ninth of the men and one-twelfth of the women were present to take the bonus.
Can you calculate the amount of money the owner spent if there were 3552 employees?
Suppose we lay down two cups in front of you. One of the cups is filled with tea and the other one with coffee. Now we ask you to take a spoonful of tea and mix it with the coffee. At this moment, the coffee cup has a mixture of tea and coffee. You have to take that mixture (spoonful) and add it back to the tea.
Can you now tell if the cup of coffee has more tea or the cup of tea has more coffee?
A mother bought three dress for her triplets daughters(one for each) and put the dresses in the dark. One by one the girls come and pick a dress.
What is the probability that no girl will choose her own dress?
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?
There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.
How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki