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?
P is the father of Q and S is the son of R. T is the brother of P and has a daughter U. If R is the sister of P, then what is the relation between U, Q and S?
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?
Using four sevens (7) and a one (1) create the number 100. Except for the five numerals, you can use the usual mathematical operations (+, -, x, :), root and brackets ()
Two friends were betting. One said to the other, "The coin will be flipped twenty times and each time the coin lands on the head, I will give you $2 and each time it lands on the tale, you will give me $3." After flipping the coin twenty times not a single penny was exchanged among them.
At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?
Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.
How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?
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