Below, you will find the mathematical proof that 10 equals 9.99999?. But is that possible or there is something wrong about it? Can you find the error?

x = 9.999999...
10x = 99.999999...
10x - x = 90
9x = 90
x = 10

A river should be crossed by a father, a mother and their two sons and two daughters.
There are some rules that should be followed while crossing the river. There can be only two people in the raft while crossing. The daughters cannot be with their father unless there is the presence of the mother. The sons cannot be with their mothers unless the father is present. Unless the guard is on the board, the criminals cannot be with any of the family members. Only the adults like the father, the guard, and the mother knows to use the raft.

How will they cross the river?

How is a fly different from a mosquito?

Can you find out the total number of triangles in the given figure?

Consider this about a word: The first two letters signify a male, the first three letters signify a female, the first four letters signify a great, while the entire world signifies a great woman. What is the word?

In the image below, can you find the value of an angle(y)

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

If in a car race, the man who came two places in front of the last man finished one ahead of the man who came fifth, how many contestants were there?

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?

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?