Solution:

Bill. If you read the message upside down, you'll notice that the numbers resemble letters and that those letters form legible sentences. The message is 'Bill is boss. He sells oil.'

Solution:

You can never solve a problem on the level on which it was created.

Here is the answer key:
A-Z
B-Y
C-X
D-W
E-V
F-U
G-T
H-S
I-R
J-Q
K-P
L-O
M-N
N-M
O-L
P-K
Q-J
R-I
S-H
T-G
U-F
V-E
W-D
X-C
Y-B
Z-A

Solution:

The only lockers that remain open are perfect squares (1, 4, 9, 16, etc) because they are the only numbers divisible by an odd number of whole numbers; every factor other than the number's square root is paired up with another. Thus, these lockers will be 'changed' an odd number of times, which means they will be left open. All the other numbers are divisible by an even number of factors and will consequently end up closed.

So the number of open lockers is the number of perfect squares less than or equal to one thousand. These numbers are one squared, two squared, three squared, four squared, and so on, up to thirty one squared. (Thirty two squared is greater than one thousand, and therefore out of range.) So the answer is thirty one.

Solution:

They are numbers for houses and it's Rs.100 per digit.

Solution:

Starting with the first two words, Take the first and last letters, reading from left to right. Example: Carrot fiascO "from these pairs" the message is as follows:

CONGRATULATIONS CODE BREAKER

Solution:

For this answer is 3^0, 3^1, 3^2... That is 1,3,9,27,81,243 and 729.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

17 mins

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 mins. 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 mins

Solution:

The women is a of short stature. She can't reach the upper elevator buttons, but can push is with his umbrella.

Solution:

He should shoot at the ground.

If Kangwa shoots the ground, it is Rafael's turn. Rafael would rather shoot at Ferdinand than Kangwa, because he is better.
If Rafael kills Ferdinand, it is just Kangwa and Rafael left, giving Kangwa a fair chance of winning.
If Rafael does not kill Ferdinand, it is Ferdinand's turn. He would rather shoot at Rafael and will definitely kill him. Even though it is now Kangwa against Ferdinand, Kangwa has a better chance of winning than before.