Take one out and scratch my head, I am now black but once was red. What am I?

There is a basket full of hats. Three are white and two are black. Three men, Tom, Tim, and Jim, each take a hat out of the basket and put it on their heads without seeing the hat they selected or the hats the other men selected. The men arrange themselves so Tom can see Tim and Jim’s hats, Tim can see Jim’s hat, and Jim can’t see anyone’s hat. Tom is asked what color his hat is and he says he doesn’t know. Tim is asked the same question, and he also doesn’t know. Finally, Jim is asked the question, and he does know. What colour is his hat?

Trying to tease Birbal, Akbar gave him one gold coin and ask him to buy
* something for him to eat
* something for him to drink.
* something to feed the cows
* something to plant in the garden
and most important you need to buy only one thing.

What must Birbal buy to silence Akbar?

_ _ _ IE _ _
_ _ _ IE _
_ _ IE _ _
_ _ IE _
_ _ _ _ IE

Like you see, some letters have gone missing from these words that contain the IE pair at some or the other place. The letters that will be used to fill the blanks are given below. Use them and form meaningful words. Can you do that?

A, C, D, F, H, K, L, M, N, N, O, R, R, S, S, S, T, T, Y and Y.

John can eat 27 chocolates in an hour, Jacob can eat 2 chocolates in 10 minutes, and Jolly can eat 7 chocolates in 20 minutes. How long will it take them to share and eat a box of 120 chocolates whilst playing Chess?

You have to put a letter on the following to make it a meaningful word. The only challenge is that you can't use 'E'.

S E Q U E N C _

I am green and found in the forest and have needles instead of leaves. What am I?
Hint 1: It can be used for Christmas decorations.
Hint 2: I have a strong, scent that is used in air fresheners.

Below, you will find the mathematical proof that 10 equals 9.99999?. But is that possible or there is something wrong about it? Can you find the error?

x = 9.999999...
10x = 99.999999...
10x - x = 90
9x = 90
x = 10

I guess 76.8% of readers will like this riddle.

What's the least number of people should read this post?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?