## Beggar's brother

A beggar's brother died, but the man who died had not brother.
How could this be?

The beggar was a women.

A beggar's brother died, but the man who died had not brother.
How could this be?

The beggar was a women.

If 20 blackbirds are on a fence and you shoot one, how many remain?

None, they would all fly away from the sound of the shot.

How can you take 2 from 5 and leave 4?

F I V E. Remove the 2 letters F and E from five and you have IV.

John Heysham Gibbon was most renowned surgeon of 1940-1970. More than 90% of his surgeries he performed are highly successful and still almost all of his patients die.

The surgery was performed way back, by now approx 90% of them have died by old age.

There are ten people in a house. Everybody wants to make a hand shake with only people shorter than themselves. Assume everybody is different in height. How many hand shakes are made?

0, because a taller person wants to shake hands with a shorter person. But the shorter person doesn't want to shake hands with him.

Two men are in a desert. They're both wearing backpacks. One of the men is dead. The man who is alive, has his pack open. The dead man's pack is closed. What is in their packs?

A parachute.

During what month do people sleep the least?

February because it's the shortest month.

One company had two factories, in different parts of the country, that were making the same style of shoes. In both factories, workers were stealing shoes. How, without using any security, could that company stop the stealing?

Make one factory make the left shoe, and the other make the right shoe.

Can you make 10 plus 4 = 2?

Yes. 10 o'clock + 4 hours = 2 o'clock.

There are n coins in a line. (Assume n is even). Two players take turns to take a coin from one of the ends of the line until there are no more coins left. The player with the larger amount of money wins.
Would you rather go first or second? Does it matter?
Assume that you go first, describe an algorithm to compute the maximum amount of money you can win.
Note that the strategy to pick maximum of two corners may not work. In the following example, first player looses the game when he/she uses strategy to pick maximum of two corners.
Example 18 20 15 30 10 14
First Player picks 18, now row of coins is
20 15 30 10 14
Second player picks 20, now row of coins is
15 30 10 14
First Player picks 15, now row of coins is
30 10 14
Second player picks 30, now row of coins is
10 14
First Player picks 14, now row of coins is
10
Second player picks 10, game over.
The total value collected by second player is more (20 + 30 + 10) compared to first player (18 + 15 + 14). So the second player wins.

Going first will guarantee that you will not lose. By following the strategy below, you will always win the game (or get a possible tie).
(1) Count the sum of all coins that are odd-numbered. (Call this X)
(2) Count the sum of all coins that are even-numbered. (Call this Y)
(3) If X > Y, take the left-most coin first. Choose all odd-numbered coins in subsequent moves.
(4) If X < Y, take the right-most coin first. Choose all even-numbered coins in subsequent moves.
(5) If X == Y, you will guarantee to get a tie if you stick with taking only even-numbered/odd-numbered coins.
You might be wondering how you can always choose odd-numbered/even-numbered coins. Let me illustrate this using an example where you have 6 coins:
Example
18 20 15 30 10 14
Sum of odd coins = 18 + 15 + 10 = 43
Sum of even coins = 20 + 30 + 14 = 64.
Since the sum of even coins is more, the first player decides to collect all even coins. He first picks 14, now the other player can only pick a coin (10 or 18). Whichever is picked the other player, the first player again gets an opportunity to pick an even coin and block all even coins.