Solution:

The answer to this riddle is "pencil lead"

Pencil lead is taken from a mine, enclosed in a wooden case, and used by almost everyone for writing and drawing. Despite being encased, it can still be used effectively.

Solution:

3/7

Explanation:
If a 31day month starts on a Friday, Saturday or Sunday it will have five Sunday, if not it will have 4 Sunday.

Solution:

4 6 5 3 (from magician perspective)
3 5 6 4 (viewer perspective)

Detail:

From user perspective:
3 5 6 4 => 5 6 4 3 => 6 5 4 3

For magician perspective
3 4 5 6 (ascending order as)

Solution:

There are three roses and four bees.

Solution:

2003.

Explanation:
Its a series of prime numbes.

Solution:

   9567
+ 1085
======
 10652

Solution:

We now have a square of 3x3 size, 2 squares of 2x2 size and 5 squares of 1x1 size.

Solution:

457730 * 4 = 1830920
(DOLLAR * 4 = QUARTER)

Solution:

The bridge won't break.

When the car has travelled half of the bridge, that is 15km, the car must have used more than 300 grams of fuel. Therefore, the impact of bird's added weight will be zero literally.

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:

100

Series of number that do not contain albhabet 'T'