Solution:

0.1667 or 16.67%

When rolling two fair six-sided dice, there are 36 possible outcomes (6 outcomes for the first die multiplied by 6 outcomes for the second die).

To calculate the probability of rolling a sum of 7, we need to determine the number of combinations that result in a sum of 7. These combinations are:

1 + 6
2 + 5
3 + 4
4 + 3
5 + 2
6 + 1

So, there are 6 favorable outcomes that result in a sum of 7.

The probability of rolling a sum of 7 is calculated by dividing the number of favorable outcomes by the total possible outcomes:

Probability = (Number of Favorable Outcomes) / (Total Possible Outcomes) = 6 / 36 = 1/6 ≈ 0.1667

Therefore, the probability of rolling a sum of 7 with two fair six-sided dice is approximately 0.1667 or 16.67%.

Solution:

888 + 88 + 8 + 8 + 8 = 1000

Solution:

60 minutes

Explanation:
Roy will be able to consume all the five tablets in an hour.

Tablet 1 will be taken in 0 min.
Tablet 2 will be taken in 15 min.
Tablet 3 will be taken in 30 min.
Tablet 4 will be taken in 45 min.
Tablet 5 will be taken in 60 min.

Solution:

The women is a of short stature. She can't reach the upper elevator buttons, but can push is with his umbrella.

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

Solution:

I will be thrown at lions. Now if Akbar threw him at lions, Birbal’s statement will stand true and he will have to bury him alive. But if he bury him, the statement will emerge as false. Thus he had no choice left

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:

The answer is 'R'

It represents the gear stick. The number 1-5 represents gears and the last one thus should be reverse i.e. R.

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:

40 balls

Solution:

Daughter.