Solution:

He is a barber.

Solution:

The attached picture gives away the solution. If you can find another solution, do send us yours.

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:

2, 3, 10 and 10
To maintain the difference of eight and keeping in mind the third and fourth hint, the first and third cards can be 2 and 10 or 10 and 2. But keeping in mind the first hint, we know that the first card is 2 and the third is 10. Similarly, if we see the fifth hint, the difference between the second and fourth card should be 7. Thus we know that the second card is 3 and the fourth card is 10.

Solution:

Jeff Killed Mike

1. Jack is not the murderer, because he is the brother of the murderer.
2. Dan can't be the murderer since he ran a marathon, and the murderer recently had his leg amputated, and wouldn't be running a marathon of any magnitude that quickly.
3. Ben is not the murderer if he just met Jack, since Jack and the murderer grew up together.
4. This leaves Jeff and Mike.

Since Jeff is still alive (he wants to install a new computer next week, present tense) he must be the murderer. Mike also didn't grow up with Jack. It has been determined that Jack, Dan and Jeff are all alive. Ben must also be alive since Jeff plans to install Ben's computer next week. This means that Jeff killed Mike.

Solution:

fIvE thOUsAnd(5000)

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:

== Mathematical Answer ==
Mathematical Answer = number of seconds in a minute * number of minute in an hour * number hour in a day * number of day in year
60 * 60 * 24 * 365 = 31536000
60 * 60 * 24 * 365.25 = 31557600 (if you want account for leap year)


== We are looking for trick answer (which is 24) ==
Every month contains only 2 second like
A) 2nd January ("second" January)
B) 22nd January (twenty"second" January)

Therefore 2 * 12 months = 24.

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:

Just One!

example
If u get Blue rock with label as "blue+red" => this is red as all labels are wrong.
In this way u can logically solve this puzzle.

Solution:

It can be solve as shown below.