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:

1/2

one of two is the possibility
1. If any of the first 99 people sit in Abhishek seat, Abhishek will not get to sit in his own seat.
2. If any of the first 99 people sit in Aishwarya's seat, Abhishek will get to sit in his seat.

Solution:

See the colored sticks in the picture. We have moved those sticks in the position given in the second image corresponding with the color.

Solution:

Since Jasmine and Thibault ate equal amount, they should pay the same amount. But since that's not possible, they can decide with 'rock, paper, scissor' or an equivalent measure to determine who will pay the extra dollar. Now, let's assume tha Jasmine pays $1 extra after losing

Jasmine will pay $5, Thibault will pay $4 and Noah will pay $2.

If the pizza's cost was $11, we can simply keep the same offset and divide. Jasmine is paying 6% more, Thibault is paying 15% more and Noah is paying 27% more.
Keeping the offset same both Jasmine and Thibault will pay $5 each and Noah will pay $1.

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:

Six.

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

Solution:

LOTTO

Explanation:
Just flip the two rows 1 and 2 vertically, you will find the word "Lotto".

Solution:

7, 4, 6, 5, 8

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

Solution:

25 Fruits

Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.

For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,

(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10

Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.

Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.

(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15

Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.