At a bar, three friends, Mr Green, Mr Red and Mr Blue, were having a drink. One man was wearing a red suit; one a green suit; and the other a blue suit. 'Have you noticed,' said the man in the blue suit, 'that although our suits have colours corresponding to our names, not one of us is wearing a suit that matches our own names?' Mr Red looked at the other two and said, 'You're absolutely correct. What colour suit is each man wearing?

You have a square. What you have to do is cut and reassemble the square such that you create a Red Cross sign that has the same volume as that of the square.

Solve the puzzle by telling what does below picture means.

There’s a girl who has a large family. She has an equal amount of brothers and sisters, but each brother only has half as many brothers and sisters. What’s the correct amount of brothers and sisters?

There is a brick of gold and a brick of iron in a boat (both 10-inch blocks), if they are both dropped into the water which will make the water level higher?

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

Buy me, smell me or deliver me, I do not change.

Who am I?

In the Mexico City area, there are two Houses H1 and H2. Both H1 and H2 have two children each.
In House H1, The boy plays for Mexico Youth academy and the other child plays baseball.
In House H2, The boy Plays soccer for his school in Mexico and they recently have a newborn.

Can you prove that the probability of House-H1 having a girl child is more than that of House-H2?

I have eight fingers and two thumbs but I do not live. What Am I?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?