A thief is convicted in Mexico. He gets the death penalty. The judge allows him to say the last sentence to determine how the penalty will be carried out. If the thief lies, he will be hanged, if he speaks the truth he will be beheaded. The thief tells the last sentence and to everybody's surprise some minutes later he is set free because the judge cannot determine his penalty. What did the thief say?

A doctor and a boy were fishing. The boy was the doctor’s son, but the doctor was not the boy’s father. Who was the doctor?

A Child was born in Lahore, Pakistan.

Still child is not a Pakistani citizen.why ?

Which digit occurred maximum times between the number 1 and 1000?

Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?

The host of a game show offers the guest a choice of three doors. Behind one is an expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

What are the 50th, 63rd and 100th numbers in the sequence below?
4, 5, 8, 8, 9, 9, 12, 13, 13, 13, 17, 18, ...

Two boys wish to cross a river. The only way to get to the other side is by boat, but that boat can only take one boy at a time. The boat cannot return on its own, there are no ropes or similar tricks, yet both boys manage to cross using the boat.

How?

There is a wide field of corn. A goose finds its way into the field and starts running. Can you find out till which point the goose can run into the field?

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?