What two things can you never eat for breakfast?

Do you know who was buried in John's tomb?

Can you find the least possible number such that

If the number is divided by 3, it gives the remainder of 1;
If the number is divided by 4, it gives the remainder of 2;
If the number is divided by 5, it gives the remainder of 3;
If the number is divided by 6, it gives the remainder of 4.

What is the next number in the series?

15 29 56 108 208 ?

Can you find out the total number of triangles in the given figure?

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?

Birbal was jester, counsellor, and fool to the great Moghul emperor, Akbar.
The villagers loved to talk of Birbal's wisdom and cleverness,
and the emperor loved to try to outsmart him.
One day Akbar (emperor) drew a line across the floor.
"Birbal," he ordered, "you must make this line shorter, but you cannot erase any bit of it."
Everyone present thought the emperor had finally outsmarted Birbal.
It was clearly an impossible task.
Yet within moments the emperor and everyone else present had to agree that Birbal had made the line shorter without erasing any of it.
How could this be?

Which letter of the alphabet has the most water?

A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.

For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.

Can you find out how much did the youngest one receive?

In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?