tangled trees
Suppose you draw rows of evenly spaced dots each, and you take out your favorite set of -sided dice. For each dot in the first row, you roll all dice. For each number rolled, you draw a line from to the dot in the row below that is in the column . Continue this process, row by row, until there is some dot in the first row that is connected to every dot in some row---say---row .
What is the expected value of
The expected value of how many distinct numbers will be rolled when throwing -sided dice:
Proved:
The expected value of the minimum number of rows so that one of the first dots covers all of the dots on row
| | | | | | | | | | | | | | | | | | | | |:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐:--😐 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
Link to plot: https://www.desmos.com/calculator/qnhlthsdip