Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

What can go up a chimney down, but can’t go down a chimney up?

A prisoner is told: "If you tell a lie, we will hang you and if you tell the truth, we will shoot you." What did the prisoner say to save himself?

There is a unique number which when multiplied by any number from 1 to 6, we will get the new number that contains the same digits only.

Can you find that number?

A large water tank has two inlet pipes (a large one and a small one) and one outlet pipe. It takes 3 hours to fill the tank with the large inlet pipe. On the other hand, it takes 6 hours to fill the tank with the small inlet pipe. The outlet pipe allows the full tank to be emptied in 9 hours.

What fraction of the tank (initially empty) will be filled in 0.64 hours if all three pipes are in operation? Give your answer to two decimal places (e.g., 0.25, 0.5, or 0.75).

Consider this about a word: The first two letters signify a male, the first three letters signify a female, the first four letters signify a great, while the entire world signifies a great woman. What is the word?

Can you solve this picture maths equation?

People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?

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 is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?