John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?
A girl says this to her best friend: “I was born in 1955, and I celebrated my 17th birthday last weekend.†Her best friend thinks she’s lying, but she’s actually correct. How is that possible?
I purchased an awesome ice cream cone having 5 different flavour scoops.
Five flavours are pistachio, mint-chip, strawberry, marshmallow, and raspberry
I will give u some clues so that you can figure out the order of flavours from bottom to top.
1. The bottom flavour of the cone has 10 letters.
2. The marshmallow scoop is between the pistachio and the mint-chip scoop.
3. marshmallow is the raspberry scoop but below the mint-chip scoop.
So can you figure out the flavour of ice cream in order from bottom to top?
Its something that each of us devours,
Not just us but birds, beats, trees, and flowers,
Frets iron and nibbles steel,
Toil hard stones to meal,
Exterminates king, collapse town,
And blows the mountains down.
John bought 150 chocolates but he misplaced some of them. His Father asked him how many chocolates were misplaced.
He gave the following answer to him:
If you count in pairs, one remains
If you count in threes, two remain
If you count in fours, three remain
If you count in fives, four remain
If you count in sixes, five remain
If you count in sevens, no chocolate remains.
Can you analyze the statements and tell us how many chocolates were lost?
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.
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