At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?

What numbers should go on the bottom line?
3 6 9 15
8 2 10 12
11 8 19 27
19 10 29 39
? ? ? ?

Find the Odd One Out?
84129
32418
47632
36119
67626
72927

The king of Octopuses has servants who have six, seven or eight legs. The distinguishing characteristics of the servants is that the one with seven legs always lie but the one with either six or eight legs speak the truth always.

One day, four servants meet and converse:

The black one says, 'We have 28 legs altogether.'

The green one says, 'We have 27 legs altogether.'

The yellow one says, 'We have 26 legs altogether.'

The red one says, 'We have 25 legs altogether.'


Can you identify the colour of the servant who is speaking the truth?

You are a thief and you are being punished for your crime. People have tied your head down on a tree with a rope that has been anchored in the ground. A candle is burning below the rope which is slowly burning it away. Just below your head, a Lion has been left loose and is waiting for you to drop down on the ground so he can have you as his lunch.

You have to survive the scenario. How will you do it?

You have a three-gallon and a five-gallon measuring device. You wish to measure out four gallons.

A Car driver was heading down a street in Washington. He went right past a stop sign without stopping, he turned left where there was a 'no left turn' sign and he went the wrong way on a one-way street. Then he went on the right side of the road past a cop car. Still, he didn't break any traffic laws. Why not?

In a boat, the father of a sailor's son is sitting with the son of the sailor. However, the sailor is not present on the boat.

Can this even be possible?

Can you solve the below algebraic mathematical equation?

(J+O+I+N+T)3 = JOINT

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?