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?

You are given four results as below:
1111 = F
2222 = E
3333 = T
Then, can you find out how to code 4444?

A new clothing store has a unique method of pricing items. A vest costs $20, a tie costs $15, a blouse costs $30, and underwear costs $45. How much would pants cost?

Jim has three close friends at his school: Michael, John and Alice. Two of them play football, two play basketball and two play hockey. The friend who does not play hockey does not play basketball as well. The friend who does not play football does not play hockey.

Can you identify which sport/s is played by which person?

Find the missing number in the series below

13 -21 34 -55 ? -144

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?

A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?

Solve the alphametic puzzle by replacing the alphabet with the number.

S T O R M +
S O L E S
=========
T O W E L
=========

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?

Complete the series by replacing "?" with the correct number.

ST ND RD TH '?'