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?

You see a boat filled with people, yet there isn’t a single person on board. How is that possible?

A man dies of old age on his 25 birthday. How is this possible?

In a science lab, a petri dish hosts a healthy colony of yeast for an experiment. Now every minute, all the yeast cells divide into two. At noon, there was just a single cell of yeast and at 1:22, the Petri dish was half full. Can you calculate when the dish will be full of yeast?

John is a strange liar.

He lies on six days of the week, but on the seventh day, he always tells the truth.

He made the following statements on three successive days:

Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it"s Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."

On which day does John tell the truth?

John and Jacob are twin brothers. One of them is a liar whereas the other one is a truth-teller.

I called their home number and one of them picked up.
I asked. 'Does John lie?' The person replied with a yes.

Whom did I talk with, John or Jacob?

Three ants are sitting at the three corners of an equilateral triangle. Each ant starts randomly picks a direction and starts to move along the edge of the triangle. What is the probability that none of the ants collide?

Why did Buffon take the goal with him after every Juventus match?

Solve the following series:
AZ, GT, MN, __, YB

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?