Three friends decide to distribute the soda cans they had among them. When all of them had drunk four cans each, the total number of cans that remained was equal to the cans each one of them had after they had divided the cans.
Can you calculate the total number of cans before distribution?
You can win me and lose me but never buy me
You can not eat me and never want to part with me
I can make you cry or bring you joy
I am not a machine and definitely not a toy
You keep me but i am not forever just yours
You might find me in a case or on a shelf next to a vase
I am hard and i am tall if you bump me i am sure to fall
I am made of different materials and am at many events
If your lucky and fight hard I might be yours
What am I ?
In an Art Gallary, When the clock hit 11 am, Artist hung the painting number 30. When it struck 4 pm, he hung painting number 240 and when it struck 7:30 pm, he hung painting number 315.
Can you determine, which painting number will he hang when the time is 9:20 pm?
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.
For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.
Can you find out how much did the youngest one receive?
It is an eleven letter word.
The first, second, third and fourth letters form a banquet's name.
The fifth, sixth and seventh letters form a car's name.
The eighth, ninth, tenth and eleventh letters form a mode of transport.
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
