Solution:

Beauty

Beauty is in the eye of the beholder (bee holder)

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

Solution:

Sansa has the siamese (conjoined) twin sister.

Solution:

9 - 8 + 76 - 5 + 4 + 3 + 21 = 100


Other ways of making number 100 (withiout using number 32)
98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
98 - 7 - 6 - 5 - 4 + 3 + 21 = 100
9 - 8 + 76 - 5 + 4 + 3 + 21 = 100
98 - 7 + 6 + 5 + 4 - 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 + 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 - 3 + 2 + 1 = 100
98 - 7 + 6 + 5 - 4 + 3 - 2 + 1 = 100
98 - 7 + 6 - 5 + 4 + 3 + 2 - 1 = 100
98 + 7 - 6 - 5 + 4 + 3 - 2 + 1 = 100
98 - 7 - 6 + 5 + 4 + 3 + 2 + 1 = 100
9 + 8 + 76 + 5 + 4 - 3 + 2 - 1 = 100
9 + 8 + 76 + 5 - 4 + 3 + 2 + 1 = 100

Solution:

3 1 2 2 1 1
1 3 1 1 2 2 2 1

Read Line as one 1 => 1
Read Line 2 as two one => 2 1
Read Line 3 as one two and one one => 1 2 1 1
and so on.

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

Solution:

The wise man told them to switch the horses and then race. In this manner, both of them will be willing to race as fast as they can to prove that the other horse (his own horse) is slow.

Solution:

You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village

Solution:

prinka is 10, in a system that awards five for each vowel.

Solution:

40 balls

Solution:

Never

Explanation:
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.

As per question, all the cars stop then. Thus, the distance will never be x miles again.