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?

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?

A certain street contains 100 buildings. They are numbered from 1 to 100. How many 9's are used in these numbers?

I have no doors but I have keys, I have no rooms but I have space, you can enter but you can’t leave! What am I?

If two's company, and three's a crowd, then whats four and five ?

Two old friends, Jack and Bill, meet after a long time.

Three kids
Jack: Hey, how are you, man?
Bill: Not bad, got married and I have three kids now.
Jack: That's awesome. How old are they?
Bill: The product of their ages is 72 and the sum of their ages is the same as your birth date.
Jack: Cool..But I still don't know.
Bill: My eldest kid just started taking piano lessons.
Jack: Oh, now I get it.

How old are Bill's kids?

Sherlock Holmes was challenged to make a pre-drawn line smaller without erasing it. He did it in fractions of seconds. How?

Doctor Alex and a bus driver John are both in love with the same woman named Olivia. The bus driver need to go for a long trip of 10 days, Before he left he gave Olivia 10 apples.

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

There's one "sport" in which neither the spectators nor the participants know the score or the leader until the contest ends.

What is it?