Solve the mathematical equation in the picture below.

Count the number of lines in the image below ?

It has horns but can’t beep. It is like to bleat but It is not a sheep. What is it?

How many times can you subtract the number two from the number fifty?

Two brothers were watching a horror film on video late one night. One brother dozed off and dreamed that he was being chased by the crazy man from the movie, who was trying to kill him. In the dream, he hid in a cupboard. There was no sound except his heart pounding, and he had no idea where his crazed captor was. He was terrified! At that moment, the video finished, and his brother put his hand on the shoulder of his sleeping sibling to wake him. The shock at that tense moment was enough that the sleeping brother suffered a massive heart attack and died instantly. True or false?

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?

In my garden, I have many trees but only one of them is the mango tree. In these mango trees, there are some mangoes(as expected).

But after a strong wind, there are neither mangoes on the tree nor on the ground. Explain?

10 people came into a hotel with 9 rooms and each guest wanted his own room. The bellboy solved this problem.
He asked the tenth guest to wait for a little with the first guest in room number 1. So in the first room, there were two people. The bellboy took the third guest to room number 2, the fourth to number 3, ..., and the ninth guest to room number 8. Then he returned to room number 1 and took the tenth guest to room number 9, still vacant.
How can everybody have his own room?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Below, you can see three complete equations and one incomplete. Based on the three complete ones, can you complete the incomplete one?

5 $ 4 $ 3 $ 9 = 4215
6 $ 9 $ 2 $ 6 = 3816
4 $ 7 $ 3 $ 3 = 1122
7 $ 2 $ 7 $ 4 = ____