John is looking at Jenifer, but Jenifer is looking at Jacob. John is married, but Jacob is not.

Is a married person looking at an unmarried person ?

John went to meet his friend Jacob, but when he was about to reach the main gate, John notices that Jacob had a mighty dog who was fastened to the tree. The chain is long enough that it allows the dog to reach the main gate.

How can the John reach the main gate?

How can you make number one disappear by adding something to it?

What has a ring but no finger?

There are five people. One of them shot and killed one of the other five.
We know following clues:
1. Dan ran in the NY City Marathon yesterday with one of the innocent men.
2. Mike consider being a farmer before he moved to the city.
3. Jeff is a top notch computer consultant and wants to install Ben new computer next week.
4. The murderer had his leg amputated last month.
5. Ben met Jack for the first time six months ago.
6. Jack has been in seclusion since the crime.
7. Dan used to drink heavily.
8. Ben and Jeff built their last computers together.
9. The murderer is Jack's brother. They grew up together in Seattle.

Consider yourself to be a famous detective "Sherlock Homles", Can you find the killer?

If six children and two dogs were under an umbrella, how come none of them got wet?

A newspaper is supposed to have 60 pages.Pages 14 and 21 are missing from the newspaper.

Can you tell me , Which other pages won't be there as well ?

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?

A bus driver was heading down a street in Mexico. 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 left side of the road past a cop car. Still - he didn't break any traffic laws. Why not?

You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'

How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?