Solution:

43

Let us break the problem into different parts.
We know that after six, all the numbers that are divisible by three can be ordered. This is because we can expand them as the sum off sixes and nines.
After twenty six, the numbers that are divisible by three if subtracted by twenty can also be ordered.
After forty six, all the numbers will fit in one of the already discussed category. Thus all the numbers can be ordered.
So forty three is the last number that does not come under any of the already discussed category.
44 = 20 + 6 * 4, 45 = 6 * 6 + 9

Solution:

The node can be connected as shown.

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.

Solution:

At first, there were 2 apples on the tree. After the wind blew, one apple fell on the ground. So there where no apples on the tree and there were no apples on the ground.
*apples => more than one apple

Another solution(non tricky one)
The wind blew so hard that the apples fell of the tree and blew along the ground.

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:

28 =>1+2+4+7+14

cannot be 1 (as number cannot be included)

Solution:

'five'

Its the count of alphabet

Solution:

31

Explanation:
Ramanujan lighting the candles in binary.
11110 =30
11111 =31

Solution:

1 2 3 4 5 6 and 7 8 6

Since summation of numbers 1-9(1 2 3 4 5 6 7 8 9) is 45 , so its impossible to divide into two equal parts.
Since we cant flip over 6 to make it 9 but we can flip 9 to make it 6 and hence the solution

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.