Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

Can you solve this picture maths equation?

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

If you read clockwise, you can form a word by inserting three missing letters in the picture given below. Can you do it?

A boy collects white seashells from the sea and brings them home every night. When he has enough of them, he decides to sell them to a trader.

The trader is ready to buy the shells and he asks the boy about the quantity. At this, the boy starts calculating. He has a giant box that contains 3 mini boxes. Two of them have another mini box inside. If the giant box can hold 50 shells, how many brown shells can he sell to the trader?

Jim and Sarah are in a long-distance relationship. Jim buys an engagement ring for Sarah and wants to mail it to her. Unfortunately, the only way to ensure the ring will be received is to place a lock on the package. Jim has locks and Sarah has locks, but neither has keys for each other’s locks. How can they make sure the ring isn’t stolen?

When my father was 31 I was 8. Now he is twice as old as me. How old am I?

A man who was outside in the rain without an umbrella or hat didn’t get a single hair on his head wet. Why?

Three fair coins are tossed in the air and they land with heads up. Can you calculate the chances that when they are tossed again, two coins will again land with heads up?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?