Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

This problem can be solved with algebra as well as logical reasoning. We are going to tell you how it is logically possible.

Be it any quantity that was present in the beginning and any liquid as well. We know that we have taken a spoonful from one glass and put it into another. Then, we have taken a spoonful from the other glass and put it into the first glass. So, at the end of it, the quantity of liquid in either glass remains same as it was in the beginning.

Therefore, we can conclude the fact that any amount of coke that is missing in the glass with coke will be present in the lemonade glass. Also, the same quantity of lemonade will be missing from the lemonade glass and will be present in the coke glass.

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:

David to play second

Explanation:
Let's suppose that David plays first and he picks 9. Then Albert will definitely pick 8. Now, David will have to pick 7 or Albert will pick 7 in his turn. But if David picks up 7, then he will score 16 that is beyond 15 and will lose. So one thing is for sure, no one will be willing to start with the highest digits.

Suppose David plays first and picks up 1, Albert will pick 2. Then David will pick 3 and Albert will pick 4. Now David will be forced to pick 9. The score is 6 to 13 and thus David will have no chance of winning.

If David Picks 9 after Albert has picked up 2, then Albert will pick 8 and the score will become 10 to 10. Thus David will pick 3 as picking 7 will send him past 15. Now Albert will pick 4 and David has nothing to pick for winning. Thus Albert wins.

Therefore, you should suggest David to play second.

Solution:

146900

Explanation:
Whenever you face such type of questions, it is wise to begin from the last thing. Here in this question the last thing will be the 9th temple. He climbed down 100 steps and thus you know, he had Rs. 100 before beginning climbing down. Thus, he must have offered Rs. 100 to the god in that temple too (he offered half of the total amount). Also, he must have dropped Rs. 100 while climbing the steps of the ninth temple. This means that he had Rs. 300 before he begand climbing the steps of the ninth temple.

Now, we will calculate in the similar manner for each of the temples backwards.
Before the devotee climbed the eight temple: (300+100)*2 + 100 = 900
Before the devotee climbed the seventh temple: (900+100)*2 + 100 = 2100
Before the devotee climbed the Sixth temple: (2100+100)*2 + 100 = 4300
Before the devotee climbed the fifth temple: (4300+100)*2 + 100 = 8900
Before the devotee climbed the fourth temple: (8900+100)*2 + 100 = 18100
Before the devotee climbed the third temple: (18100+100)*2 + 100 = 36,500
Before the devotee climbed the second temple: (36500+100)*2 + 100 = 73300
Before the devotee climbed the first temple: (73300+100)*2 + 100 = 146900

Therefore, the devotee had Rs. 146900 with him initially.

Solution:

Yes it is possible in Roman Numerals. In Roman Numerals,
9 = IX
10 = X
11 = XI

Thus by removing one from 9, you are getting 10 and by removing one from 11, you are getting 10 again.

Solution:

1653

Explanation:
For an ideal case, the batsman will hit a six on each ball. But if he hits six on the last ball of the over, the strike will change in the next over. Thus, the best he can do in the last ball is run 3 runs so that he retains the strike even in the next over. Thus the total runs that he can score in each over:
6 * 5 + 3 = 33
But this will have to go like it only till the 49th over. In the last over, he can hit a six in the last ball as well as that will be the last ball of the match.
Thus runs for the last over will be 6 * 6 = 36.
Hence the maximum runs = 33 * 49 + 36 = 1653

Solution:

This puzzle has no answer if you are considering this figure in a 2d domain. However if you follow it on a three-dimensional plane, you can do it like shown in the figure given.

Solution:

There are three roses and four bees.