Solution:

Footsteps

Solution:

45 minutes

Explanation :
All you have to do is burn the first rope from both the ends and the second rope from one end only simultaneously. The first rope will burn in 30 minutes (half of an hour since we burned from both sides) while the other rope would have burnt half. At this moment, light the second rope from the other end as well. Where, the second rope would have taken half an hour more to burn completely, it will take just 15 minutes as we have lit it from the other end too.

Thus you have successfully calculated 30+15 = 45 minutes with the help of the two given ropes.

Solution:

There is no reason whatever why the customer's original deposit of Rs.100 should equal the total of the balances left after each withdrawal.
The total of withdrawals in the left-hand colum may equal Rs.100, but is is purely coincidence that the total of the right-hand column is close to Rs.100.
Let us show another example, but starting with Rs.200 in the bank:
Withdrawals Balance left
Rs.50 Rs.150
Rs.25 Rs.125
Rs.10 Rs.115
Rs.8 Rs.107
Rs.5 Rs.102
Rs.2 Rs.100
Rs.100 Rs.699
Moral of this story? Don't Total Balances

Solution:

zero

I had 3 green socks and 1 Pink sock.

=> chances of pair of green socks = 1/2
chances of pair of mixed socks = 1/2
chances of pair of green socks = NULL

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

   9567
+ 1085
======
 10652

Solution:

To do this, he must be pushing the cork inside the bottle and then taking out the coin.

Solution:

Six.

There are only five colors, so six socks guarantee that two will be the same color.

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:

Although it looks complicated, the answer is simple. The password to his computer is JIGSAW.
1st letter of Jug = J
2nd letter of Birthdays = I
3rd letter of Fights = G
4th letter of Cars =S
2nd letter of Laptops = A
1st letter of Watch = W

Solution:

prinka is 10, in a system that awards five for each vowel.