Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.
They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?
What is the four-digit number in which the first digit is one-third the second, the third is the sum of the first two, and the last is three times the second?
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?
Assume the given figure to be a delicious doughnut. Yes, now you can concentrate more on the puzzle. So you have this delicious doughnut in your refrigerator when your friends come knocking at the door. There are eight of them. Now you have to make three cuts in this doughnut so that each one of you nine people can enjoy a piece of it. Neither you nor your friends would mind the size of their piece as long as they are getting it. How will you do it?
Five thieves looted a bank and they ran away in a car. The bank staff informed the police and they began the search of their car in their jeep. They found them on a road and chased them eventually catching them. The light that is used to fill the number plate was broken on the thieves' car. Also, the headlights of the jeep police were not working. How were the police able to catch the thieves then?
Kareena is older than Bipasha. Bipasha is younger than Karishma and younger than Katrina. Katrina is older than Kareena and Alonso, who are older than Karishma.If Alonso and Kareena are twins, who's oldest?
In the addition below, all digits have been replaced by letters. Equal letters represent equal digits and different letters represent different digits.
ABCABA
BBDCAA
ABEABB
ABDBAA
------- +
AAFGBDH
What does the complete addition look like in digits?
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