Solution:

60.

Explanation:
When you write equation in stright line, you observe consective 2's.
2 + 2 + 2 + 2 + 22 + 2 + 2 + 2 + 22 + 2 x 0 + 2 = 2 x 22 + 8 x 2 + 0 = 44 + 16 + 0 = 60.

Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.

Solution:

The password is U472BMT.

Read aloud the line and you will sound something like "U Four Seven 2 B M T".

Solution:

Ms. Britney did it.

We will take up every person and analyze the statements over all of them one by one.

Case 1: Ms. Britney did it, then
Statement 1 => true
Statement 2 => false (as Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
Our first guess itself was right but let us confirm our analysis by analyzing the statements over others.

Case 2: Ms. Rihanna did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => true
Statement 3 => true (as Ms. Britney is not lying)
As per the conditions, three statements had to be wrong but here, we have two statements right which clearly contradict the condition.

Case 3: Ms. Gwyneth did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
She did not do it as all the statements are false.

Case 4: Ms. Yoon did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
All four statements are false in her case as well thus she did not do it.

Therefore we have proved that Ms. Britney did it.

Solution:

The code word is TIE.

Let us assume that the word is MOD. Now if you are told one character of this word, you would not be able to identify the number of vowels in the word. For example if you are told M, then the word can be MOD or AIM but they both have different number of vowels. If you are told about O, then there are two words MOD and OAT which again have different number of vowels. If you are told about D, there are two words again MOD and DUE which have different numbers of vowels again.

In such manner, all the words that have M, O or D in them can be excluded. Then only word that remains is TIE.
If you are told about T, there are two words OAT and TIE which both have two vowels.
If you are told about I, there are two words AIM and TIE which both have two vowels.
If you are told about E, there are two words DUE and TIE which both have two vowels.

Thus TIE is the code word.

Solution:

Jeff Killed Mike

1. Jack is not the murderer, because he is the brother of the murderer.
2. Dan can't be the murderer since he ran a marathon, and the murderer recently had his leg amputated, and wouldn't be running a marathon of any magnitude that quickly.
3. Ben is not the murderer if he just met Jack, since Jack and the murderer grew up together.
4. This leaves Jeff and Mike.

Since Jeff is still alive (he wants to install a new computer next week, present tense) he must be the murderer. Mike also didn't grow up with Jack. It has been determined that Jack, Dan and Jeff are all alive. Ben must also be alive since Jeff plans to install Ben's computer next week. This means that Jeff killed Mike.

Solution:

16-days

In 15-days, he will climb 15-inch and when he climbs 5 inch more, he will be out of the well :-)

Solution:

17 min

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 minutes. Is that it? No. That would make this question too simple even as a warm up question.

Let's brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let's put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 minutes

Solution:

Solution can be verified from the picture below.

Solution:

I am word "Introvert"

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.