Look at the below sequence of letters and tell us what the next letter should be:

O T T F F S S ?

Solve the equation by replacing the alphabet with numbers.

MOM + MOM + NO = BOOK=

2, 3, 5, 9, 17, _ What is the next number in the sequence?

An infinite number of mathematicians are standing behind a bar. The first asks the barman for half a pint of beer, the second for a quarter pint, the third an eighth, and so on. How many pints of beer will the barman need to fulfill all mathematicians' wishes?

A car is crossing a 20 km-long bridge. The bridge can support at most 1500kg of weight over it. If somehow, the weight on the bridge becomes more than that, it will break.

Now, the weight of the car is exactly 1500kg. At the midway, a bird comes and sits on the roof of the car. This bird weighs exactly 200 grams.
Can you tell if the bridge breaks at this point or not?

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?

John is selling fruits.
He sells grapes at $30, Dates $25, and a Wolfberry $45.
At what price does he sell fig?

PS: Logical Thinking

A frog is at the bottom of a 30-meter well. Each day he summons enough energy for one 3-meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well?

Once upon a time, there was a castle on a square island. The entire island was surrounded by a 14m wide trench. The Romans had wanted to invade the castle and had brought a few wooden planks along with them to facilitate themselves in crossing the moat. The planks were however found to be only 13m long.

The Romans still managed to cross the trench. How did they do it?

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?