Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?

Why are all black people so quick ?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

I know a 5-digit number having a property that With a 1 after it, it is three times as large as it would be with a one before it.

Guess the number?

I shave every day, but my beard stays the same. What am I?

If we tie a Sheep to one peg, a circled grass is been eaten by the Sheep. If we tie the Sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the Sheep. If we want an eclipse then we put two pegs and then put a rope in between them and the other end of the rope is tied up on the Sheep's neck.

How should we tie the peg and the Sheep so that a square is eaten out from the garden grass? We only have one Sheep rope and the peg and the rings.

I inserted a coin in a bottle and closed its mouth with the help of a cork. Now, I was able to take the coin out from the bottle without taking out the cork or breaking the bottle. Can you tell me how I did it?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

It is a six-letter word.
The first four letters are me.
The second and last letters are the same.
The fourth second and last letter is payment.

Who is it?

Can you find a five letter word that is left with only two letters if one is removed?