A beggar on the street can make one cigarette out of every 6 cigarette butts he finds. After one whole day of searching and checking public ashtrays the beggar finds a total of 72 cigarette butts. How many cigarettes can he make and smoke from the butts he found?

Take one out and scratch my head, I am now black but once was red. What am I?

A famous swimmer can swim downstream in a lake in exactly 40 minutes with the lake current.
He can swim upstream in that lake in exactly 60 minutes against the lake current.
The length of the lake is 2 km.

How long he can cover the distance of one side at a still lake with no current?

A high school has a strange principal. On the first day, he has his students perform an odd opening day ceremony:

There are one thousand lockers and one thousand students in the school. The principal asks the first student to go to every locker and open it. Then he has the second student go to every second locker and close it. The third goes to every third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth student does this to every fourth locker, and so on. After the process is completed with the thousandth student, how many lockers are open?

Why is it against the law for a man living in Delhi to be buried in Mumbai?

Use the numbers 2, 3, 4 and 5 and the symbols + and = to make a true equation. Conditions: Each must be used exactly once and no other numbers or symbols can be used.

My location can be determined by the below rebus.
So where am i ?

On a special event at the prison, 5 prisoners John, Jacob, Krist, Tang, and Dang given a chance to go to a sauna and can bring one thing with them.

Following are the things that the prisoners bring with them.
John: A soda
Jacob: Thermos
Krist: Book named "How to kill"
Tang: A Walkman
Dang: Harmonica

Since it is a Sauna, no one can see each other. After a while When the steam is switched, Tang was found dead and there was blood all around.
J Bond was called and he instantly come to know who can be the murderer. How?

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?

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?