One fine day, an intellectual man came to the emperor's court with the aim of testing Birbal's wittiness. In order to do this, he challenged Birbal to answer his question and hence prove that he was as intelligent and witty as he was said to be.
He asked Birbal, Do you want me to ask one difficult question or a hundred easy ones?
Since both Akbar and Birbal had had a tough day and were eager to leave, Birbal hastily told the intellectual to ask him a single difficult question.
Intellectual: OK. Tell me what came first into the world, the egg or the chicken?
Of course, the chicken, Birbal replied with a smile.
This time with a note of victory in his voice, the intellectual asked Birbal, How will you demonstrate that?
What did Birbal say?

The person who makes it has no need for it; the person who buys it has no use for it. The person who uses it can neither see nor feel it. What is it?

Nine marbles are arranged in the image below. Can you slide two marbles to form a square?

Using eight eights and addition only, can you make 1000?

When you say goodbye, I am what you need to tie.
I come as a couple and go wherever you run.
Who am I?

With the help clues provided in the image, can you find the 5 digit key?

How much will a 38° angle measure when looked at under a microscope that magnifies ten times?

By using 'because' continuously three times, can you make an English statement ?

You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.

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?