Solution:

Next in sequence is 13112221.

This series describes each number that came before it:
1 [One]
11 [One One]
21 [Two One(s)]
1211 [One Two and One One(s)]
111221 [One One, One Two, and Two One(s)]
312211 [Three One(s), Two Two(s), and One One]

The next number in the series is:
13112221 [One Three, One One, Two Two(s), Two One(s)]

Solution:

Tuesday

We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.

This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.

So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

The young lady was presented with a bill which belonged to the elderly woman. She had asked the waiter to collect the bill from her daughter.

Solution:

The password is U472BMT.

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

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:

45 minutes

Explanation :
All you have to do is burn the first rope from both the ends and the second rope from one end only simultaneously. The first rope will burn in 30 minutes (half of an hour since we burned from both sides) while the other rope would have burnt half. At this moment, light the second rope from the other end as well. Where, the second rope would have taken half an hour more to burn completely, it will take just 15 minutes as we have lit it from the other end too.

Thus you have successfully calculated 30+15 = 45 minutes with the help of the two given ropes.

Solution:

The node can be connected as shown.

Solution:

They are matched as shown in the picture below.

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:

23rd day

1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 + 11 + 12 + 13 + 14 + 15 + 16 + 17 + 18 + 19 + 20 + 21 + 22 + 23 = 276

Thus our anniversary falls on the 23rd day of the month.

You can apply other formulas to shorten the process but that is the simplest way to do it.