Solution:

Here, there are two events that are independent of each other. Now, in such case, we calculate the probability of both occurring A and Bas:
P(A and B) = P(A) * P(B)
P(Pink) = 1/5
P(Pink and Pink) = P(Pink) * P(Pink)
= 1/5*1/5
= 1/25

Solution:

The best way is to divide the batteries in three groups. Take three batteries in two groups each and two batteries in the third group.

In the groups with three batteries, you can have three possible combinations in each group. In the group with two batteries, you can have just one possible combination.

If you add the combinations: 3 + 3 + 1 = 7, you get the least number of pairs you must check.

Solution:

Brian is the one who speaks truth.

Adam is lying about Brian. Also Cody Is lying since Brian does not lie. Thus Brian is the one speaking truth. Any other combination will fail to come out true.

Solution:

No Excuse

Explanation:
Since there is no X listed =>No Excuse

Solution:

Impossible

Explanation:
Let us first denote everything with variables.
d= distance to your friend's place
T = time taken to get there
t = time required to get back
R = Speed while returning back

d = 20T
T = d/20

d = Rt
t = d/R

We have made equations for T and t and now we can derive an equation for the round trip.

2d = 40(T + t)
2d = 40(d/20 + d/R)
2d = 40d(1/20 + 1/R)
1 = 20(R/20R + 20/20R)
20R = 20(R+20)
R = R + 20

Do you see the paradox here? You literally have to travel back at an infinite speed if you want to make the average speed of your trip 40 mph. The faster return speed will have lesser impact of the average speed but consider that the quicker your return trip is, the faster you will make it.

We are talking about travelling double the distance in the same time that was taken for one way trip. Thus, if you travel at infinite speed, you will be able to attain an average of 40 mph.

Solution:

Yes, a Palm Tree.

Bonzai can be logical solution

Solution:

43

Explanation:
Here is the thing. You can buy any number of wings that can be divided evenly by three except for three by using the combinations of boxes of 6 and boxes of 9. (You must use at most the box of 9 and then multiple boxes of 6). Now, if there is a number that can't be divided by 3, use a box of 20. After purchasing the box of 20, if the number that remains is divisible by 3, then you are good to go. On the other hand if it is not, you will have to use a second box of 20. And the remaining number will definitely be divisible by 3.

Thus if we calculate the largest number that can't be bought is the one that requires two 20 pieces boxes before the remainder can be thinned down to a number divisible by 3. We know that 3 is the number that can't be purchased and can evenly be divisible, the largest possible number of wings that can't be bought are:
3 + 20 + 20 = 43.

Solution:

6

Explanation:
(2^x)(30^3) = (2^3) (3^3) (4^3) (5^3)

(2^x)(30^3) = (120^3)

(2^x) = (120^3)/ (30^3)

(2^x) = (4^3)

(2^x) = 64

ln(2^x) = ln(64)

x ln(2) = ln(64)

x = ln(64)/ln(2)

x = 6

Thus x = 6.

Solution:

They can say this line only on Thursday.

Explanation:
Let us analyze the statement. If the person who is speaking this line is speaking truth, then the person will have to speak a lie on the next day. But if the person is lying, the next day, that person must speak truth on the next day.

If you notice here, the behavior is changing on the next day no matter what the person speaks. If we create a response table for both Jack and Rose, it will look like this:

Jack Rose
Monday Truth Truth
Tuesday Truth Lie
Wednesday Truth Lie
Thursday Truth Lie
Friday Lie Truth
Saturday Lie Truth
Sunday Lie Truth

Now as you can clearly see, Jack can say this statement on Thursdays and Sundays while Rose can say this statement on Mondays and Thursdays.

Since they are saying on the same day, the required day is Thursday.

Solution:

AMAN

Explanation:
The numbers actually corresponds to the months of the year.

4 - April
5 - May
8 - August
11 - November

Now when you combine the initials of these months, you will get the killer's name i.e. AMAN