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.

What is the below Rebus indicate?

The host of a game show offers the guest a choice of three doors. Behind one is an expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M

How many triangles are there in the picture below?

A crime was committed at baker street. Ibrahim Dakota who was shot in the stomach was the main suspect. Sherlock questioned the suspect. The conversation started as:
Sherlock: What's your story, Ibrahim?
Ibrahim: I was walking around baker street and suddenly a man from the back shot me. I ran as fast as I could to save my life".
Sherlock: That is enough (and ask the police to arrest him).

Why does Sherlock think he is the murderer?

John’s parents have three sons: Snap, Crackle, and what’s the name of the third son?

A container contains 100 eggs. They can be either fresh or rotten. What is sure is the fact that there is at least one fresh egg in that container.

If you are asked to pick two eggs randomly from the container, at least one of them will be rotten.

Can you calculate how many eggs in that container are fresh?

When does a USA Potato change its nationality?

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?