Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

Can you find out a way through which you can make five squares out of the given figure by moving just six match sticks?

You have two buckets - one holds exactly 5 gallons and the other 3 gallons. How can you measure 4 gallons of water into the 5 gallon bucket?

(Assume you have an unlimited supply of water and that there are no measurement markings of any kind on the buckets.)

You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'

How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?

John is found dead in a bare field. Nobody killed John,
John did not commit suicide.

Inspector Jacob found a bag just a few meters away from John which could save his life. What was in the bag?

There is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.

You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?

On a magical land of Mexico , all the animal in the land are rational.

There are 10 tigers and one goat.
Tiger can eat goat but since it's a magical land , the tiger who eats the goat , turns into goat and then can be eaten by the remaining tiger(s).

If we leave them for some time then how many goat and tiger will be there , when we come back ?

Can you solve the below tricky visual equation?

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?