Before Mount Everest was discovered, what was the highest mountain in the world?

One evening there was a murder in the home of a married couple, their son and daughter. One of these four people murdered one of the others. One of the members of the family witnessed the crime.

The other one helped the murderer.

These are the things we know for sure:

1. The witness and the one who helped the murderer were not of the same sex.

2. The oldest person and the witness were not of the same sex.

3. The youngest person and the victim were not of the same sex.

4. The one who helped the murderer was older than the victim.

5. The father was the oldest member of the family.

6. The murderer was not the youngest member of the family.

Who was the murderer?

There was once a troop of 5 elves. The 5 elves were very dedicated on finding the magical treasure of 1000 coins. However, being elves, they were super geniuses, very greedy and they did not hesitate in taking lives of other elves. The 5 elves were named Aye, Bee, Cee, Dee and Ee, ranked from high to low respectively, from Aye to Ee. One fine day, their efforts brought results and they found 1000 coins. Now they had to split it in between them as per their ranks. The lowest ranked elf has to make the proposal. If the proposal is accepted by majority, it is agreed, or the suggesting elf is killed.

What proposal should elf Ee make ?

If you're 8 feet away from a door and with each move you advance half the distance to the door. How many moves will it take to reach the door?

A red house is made out of red bricks. A yellow house is made out of yellow bricks. And, a blue house is made out of blue bricks. So, what is a greenhouse made of?

If in a code language, DISTANCE is written as IDTUBECN and DOCUMENT is written as ODDVNTNE, the how will THURSDAY be coded as in the same language?

If you read clockwise, you can form a word by inserting three missing letters in the picture given below. Can you do it?

Which is the rope you never skip with?

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?

Can you solve the equation by finding the value of
A) Horse
B) Cowboy boot
C) Horseshoe

In the Picture?