An infinite number of mathematicians are standing behind a bar. The first asks the barman for half a pint of beer, the second for a quarter pint, the third an eighth, and so on. How many pints of beer will the barman need to fulfill all mathematicians' wishes?

Can you count the number of seconds in a year?

Clue: You need to bother about calculation.

John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.

Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.

Jill dies due to thirst. Who murdered Jill?

In a contest, four fruits (an apple, a banana, an orange, and a pear) have been placed in four closed boxes (one fruit per box). People may guess which fruit is in which box. 123 people participate in the contest. When the boxes are opened, it turns out that 43 people have guessed none of the fruits correctly, 39 people have guessed one fruit correctly, and 31 people have guessed two fruits correctly.
How many people have guessed three fruits correctly, and how many people have guessed four fruits correctly

There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?

What two things can you never eat for breakfast?

It has horns but can’t beep. It is like to bleat but It is not a sheep. What is it?

Christina has four daughters, and each of her daughters has a brother. How many children does Christina have?

Can you spot the hidden girl in the picture below?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?