A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

It's a protector.
It sits on a bridge.
One individual can see directly through it, while others wonder what it hides.

What is it?

There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.

How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?

A man calls his dog from the opposite side of a river. The dog crosses the river without a bridge or a boat and manages to not get wet. How is this possible?

Give it food and it will live; give it water and it will die.

Can you make the below equation true by using any three numbers from "1, 3, 5, 7, 9, 11, 13 and 15"?

( ) + ( ) + ( ) = 30

Can you divide numbers from 1 to 9 (1 2 3 4 5 6 7 8 9) into two groups so that the sum of the numbers of each group is equal?

Note: 9 cannot be turned over to make it 6.

I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).

I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.

What is the probability that another side is also tail?

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?

In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.