A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

In the addition below, all digits have been replaced by letters. Equal letters represent equal digits and different letters represent different digits.
ABCABA
BBDCAA
ABEABB
ABDBAA
------- +
AAFGBDH
What does the complete addition look like in digits?

There are six people in a family namely M, N, O, P, Q and R.

R and O are brother and sister.

N is the brother of Q's husband.
P is the father of M and grandfather of R.

How many male members are in the family?

What jumps when it walks and sits when it stands?

The peacock is a bird that does not lay eggs. How do they get baby peacocks?

Identify The phrase in the picture.

When my father was 31 I was 8. Now he is twice as old as me. How old am I?

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

What is both possible and impossible at the same time?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?