The richest man in the city Mr Rechard is kidnapped. James Bond is appointed to the case. At the crime scene, a note is found written by Mr Richard. The note read:

"First of January, Fourth of October, Fifth of March, Third of June."

James Bond knew that somehow, the killer's name was hidden in the note. The following were the suspects:

Jack Richard, the son and the heir of property.
John Jacobson, the employee of Richard.
June Richard, the wife of Richard.

James Bond took only a few moments to deduce the killer's name. Can you tell who was the killer?

I am a mother. However, I never give birth.

I am a father. However, I never nurse my children.

Wandering is not possible for me, but standing still happens occurs rarely.

Who am I?

In the Thar desert, 3 men found a big 24L Jar is full of water. Since there is a shortage of water so they decided to distribute the water among themselves such that they all have equal amounts of it. But they only have a 13L, a 5L and an 11-litre Jar.

How do they do it?

There is one four-digit whole number n, such that the last four digits of n2 are the original number n

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?

Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

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?

What goes up but never comes down?

What has no start, end, or centre?

Only one color, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?