Solution:

Periodic Table

Solution:

30,450 miles.

Explanation:
For each 5 miles driven using this rotation, each tire will lose (2/29000)+(2/21000) of its tread.So, suppose we drive 5*N miles like this. Then, each tire will lose 2*N*((1/29000)+(1/21000)) of its tread. We wish to determine N so that the latter expression gets to be 1, representing all of each tire's tread. That happens when N=6090, which is when 5*N (the total miles driven) is 30,450.

Solution:

Zouma is 3 and has two footballs.
Ake is 1 and has one football.
Kalas is 4 and has three footballs.
Aina is 2 and has four footballs.

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

Solution:

2 cakes

At each toll bridge you are required to give half of your cakes, and you receive one back. Which leaves you with 2 cakes after every bridge.

Solution:

one fish, one cat and one dog.

Explanation:
The question might appear a bit difficult in the starting but if you analyze the statements, you will realize that it is just a tricky one.

All except two were fishes and all except two were cats. With these statements we can assume that two of the animals were not fishes and two were not cats. Now one of those animals that are not fishes can be a cat and one of those two animals that are not cats can be a fish. Just carry out the same analysis for the statement that all except two animals were not dogs and you will come across the result i.e.:
In that competition, there was one fish, one cat and one dog.

Solution:

I am Spice

Explanation:
Spice is hot if you remove first two alphabets then it will become "ice", which is really cold.

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:

4

No Of circles in the number.

Solution:

23rd day

1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13 + 14 + 15 + 16 + 17 + 18 + 19 + 20 + 21 + 22 + 23 = 276

Thus our anniversary falls on the 23rd day of the month.

You can apply other formulas to shorten the process but that is the simplest way to do it.

Solution:

On Your lap.