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?

Analyze and find the missing item in the sequence:
16, 06, 68, 88, __, 98

Krish is 45 years old and his mother Crishtina is 73 years old.

Can you find out how many years ago, his mother was three times his age?

A rain drop fell from one leaf to another leaf and lost 1/4th of its volume. It then fell to another leaf and lost 1/5th of the volume. It again fell on another leaf and lost 1/5th of the volume.



This process kept repeating till it fell on the last leaf losing 1/75th of its volume.



Can you calculate the total percentage of loss from the initial volume when the drop has fallen to the last leaf accurate up to two decimal places?

There is something which you can be arrested for attempting but not for successfully completing.

I have one of the three numbers: 1, 2, or 3 in my mind. I speak only truth. You can ask me just one question for which I will only reply in yes or no or don't know. What question will you ask from me so that you are able to know the number?

John was visiting his friend Jacob. He found out that his friend's wife had just killed a burglar in self-defense.
John asks Jacob about what happened and he told that "His wife was watching television when suddenly the bell rang. She thought that it is her husband Jacob but she found the burglar who attacked her instantly and she got so frightened that she killed the burglar immediately with the knife.
John asked the police to arrest his friend's wife. Why?

Decode below rebus
D
N
A
T
S , D

Can you decipher the two rows to find the hidden word?

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?