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?

During a secret mission, an agent gave the following code to the higher authorities
AIM DUE OAT TIE MOD

However, the information is in one word only and the rest are fake. To assist the authorities in understanding better, he also sent them a clue, If I tell you any one character of the code, you can easily find out the number of vowels in the codeword.

Can you find out the code word?

There are two dice with empty faces in front of you and a marker. You can mark any number on each of the faces of the two dice, but you have to display all 31 days of the month using the two of them.

Which numbers will you mark on which dice so that you can easily depict all the dates of the month?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

One absent-minded ancient philosopher forgot to wind up his only clock in the house. He had no radio, TV, telephone, internet, or any other means for telling time. So he travelled on foot to his friend's place a few miles down the straight desert road. He stayed at his friend's house for the night and when he came back home, he knew how to set his clock. How did he know?

Jack was having a candle light dinner with his girlfriend. Suddenly a cold gush of wind entered through the open window and three of the ten candles were extinguished. Assuming that none of the other candles were extinguished.

How many candles are they left with in the end ?

Is the statement valid that it does not matter how much older a sibling is, eventually the younger one will be half as old as the older one?

Jessica is telling her friends this story and asks them to guess if it’s the truth or a lie: “There was a man sitting in a house at night that had no lights on at all. There was no lamp, no candle, and no other source of light. Yet, he sat in the house and read his book happily.” Her friends say she’s lying, but Jessica corrects them and says she’s telling the truth. Jessica’s story is true—but how?

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?

John is 45 years older than his son Jacob. If you find similarities between their ages, both of their ages contain prime numbers as the digits. Also, John's age is the reverse of Jacob's age.

Can you find their ages?