Expected Maximum of Rolling an m-Faced Dice n-Times

Правка en1, от Sajjat004, 2025-08-01 15:56:29

Problem Statement
Suppose you have a fair dice with $$$m$$$ faces, numbered from $$$1$$$ to $$$m$$$. You roll this dice $$$n$$$ times independently, and each face has an equal probability of $$$ \frac{1}{m} $$$. Find the expected value of the maximum number obtained after these $$$n$$$ rolls.

Expected Maximum
If you roll an $$$m$$$-faced dice $$$n$$$ times, then there are $$$m^n$$$ possible combinations of rolls. The expected maximum is the average of the maximum values obtained from all $$$m^n$$$ combinations of rolls.

Intuition:
We have to compute the expected maximum value. That is

$$$ \text{Expected max} = \sum_{i=1}^{m} i \cdot P(\max = i) $$$
Теги probability, expected value

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский Sajjat004 2025-08-02 10:33:50 0 (published)
en4 Английский Sajjat004 2025-08-02 10:17:45 1
en3 Английский Sajjat004 2025-08-02 10:14:22 80
en2 Английский Sajjat004 2025-08-02 10:12:39 949 Tiny change: 'l gives a $value ≤ i$ is $\fr' -> 'l gives a value ≤ $i$ is $\fr'
en1 Английский Sajjat004 2025-08-01 15:56:29 705 Initial revision (saved to drafts)