I have a math problem which states the following:
"Roll a 6-sided die. Then roll a 10-sided die. Then roll a 20-sided die.
Will the results be in strictly increasing order?
Example: [1,2,3] is true where [1,3,3] is false."
My assignment is to assign a probability to the statement being true.
I have figured this problem has $n_{\textrm{permutations}} = 6 \cdot 10 \cdot 20 = 1200$ permutations, but I don't know an elegant way to calculate the number of these permutations that are in strictly increasing order. I guess it is some kind of combinatorics problem with a k-word of length 3 etc. but have not managed to get across the finish line.
Appreciate all help.
Apply total probability theorem (1s level branches for the 6-sided die, then 2nd level branches for the 10-sided die, and 3rd level branches for the 20-sided die, all with same respective probabilities 1/6, 1/10 and 1/20):
$\sum_{i=1}^6 \frac{1}{6} \left( \sum_{j=i+1}^{10} \frac{1}{10} \left(\sum_{k=j+1}^{20} \frac{1}{20} \right) \right) =$
$\frac{1}{6 \cdot 10 \cdot 20} \sum_{i=1}^6 \left( \sum_{j=i+1}^{10} \left( \sum_{k=j+1}^{20} 1 \right)\right) =$
It takes time to do the math, but if you use the computer, then you get 506 over 1200.
The maths imply a sum of arithmetic sequence within the $k$ summands (from $j+1$ to 20), then a sum of squares of numbers in the $j$ summands, and a sum of cubes of numbers in the $i$ summands.
A little bit of it: