A solo dice game is played. In this game, upon each turn, a normal pair of dice is rolled and the score is calculated not by adding the numbers but multiplying them.

In a particular game, the score for the second roll is five more than what was achieved in the first roll. The score for the third roll is six less than what was completed in the second roll. The score for the fourth roll is eleven more than what was achieved in the third. The score for the fifth roll is eight less than what was completed in the fourth.

Can you calculate the score for each of the five throws?

Chhote se Chintu Miyan,
Lambi si Pooch.
Jahan Jaye Chintu Miyan,
Wahan Jaye Pooch.

छोटे से चींटू मियाँ,
लंबी सी पूंछ।
जहाँ जाये चींटू मियाँ,
वहाँ जाये पूंछ।

Bolo kya?

I have branches, but no fruit, trunk or leaves. What am I?

A number can be multiplied by multiple of nine
i.e 9 18 27 36 45 ...

and the resulting number consist of only one digit.

Can you identify the number ?

What is wrong in the below Picture?

I never stop running even when I standstill. If I am formed by joining two identical bodies together, can you guess who I am?

Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

Replace the question mark with the correct number.

2 + 2= 4
3 + 3= 18
4 + 4= 48
5 + 5= ?

Can you identify the famous TV character from the rebus below?

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?