Solution:

A
D
C
A
B

Solution:

5050

Explanation:
You must have noticed that 50 pairs of n^2 – (n-1) ^2 exist.
n^2 – (n-1)^2 = n + (n – 1)

In such case, we may as well write 100^2 - 99^2 + 98^2 - 97^2 + 96^2 - 95^2 + ... + 2^2 - 1^2 as 100 + 99 + 98+ ... + 2 + 1 = (100 x 101)/2 = 5050

Solution:

The woman told him to take out one nut each from the rest of the wheels and use them.

Solution:

If the man killed himself, he would not have been able to rewind the cassette. Thus it is clear someone else killed him.

Solution:

12 steps:

Steps 11 Liter jug 6 Liter Jug
1. 11 -
2. 5 6
3. 5 0
4. 0 5
5. 11 5
6. 10 6
7. 10 0
8. 4 6
9. 4 0
10. 0 4
11. 11 4
12. 9 6 ==> i found 9 liter in 11liter jug(as required)

Solution:

Typewriter

Solution:

White should move the rook from
A1 to D1 and hence complete the castling move.

Solution:

I(1) + ate(2^3 is 8) + Some(Sum symbol) + Pie(Symbol)
= I Ate Some Pie and It Was Delicious

Solution:

PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS.

Solution:

17 min

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 minutes. Is that it? No. That would make this question too simple even as a warm up question.

Let's brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let's put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 minutes