A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?
Using the clues below, what four numbers am I thinking of?
The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.
I have one of the three numbers: 1, 2, or 3 in my mind. I speak only truth. You can ask me just one question for which I will only reply in yes or no or don't know. What question will you ask from me so that you are able to know the number?
There is a family that live in a round house. The two parents go out for a movie and leave a babysitter to watch their son. They come back and the kid was not there. Some one kidnapped him. The maid said she was cleaning in a corner. The cook said he was making pizza. The babysitter said she was getting a board game. Who kidnapped him.
* When we multiply three numbers, we will get the prime numbers.
* The difference between the second and the first number is equal to the third and second.
Sweet & very intelligent katty has 8 puppets(Jane Bird Barbie Angel Colleen Nora Lass Missy).
All puppets are of different size. She arrange all puppets to face towards the guest and tell the guess the following clues :
* Jane has three puppets bigger on its left side
* Bird has two puppets smaller on its left side
* Barbie has one puppet bigger on its right side
* Angel has two puppets smaller on its right side
* Colleen has one puppet bigger on its left side
* Nora has one puppet smaller on its left side
* Lass has four puppets bigger on its right side
* Missy has three puppets smaller on its right side
Also some puppets are inside the bigger puppets.
Assuming you are the guest , can you tell the katty how the puppets are arranged ?
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
