Skip to content

Commit 3473e53

Browse files
Fix integer interval notation using hack.
1 parent 8bd7837 commit 3473e53

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

contents/probability/distributions/distributions.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@ For example, it could be a number like the outcome of a __die roll__ which has t
3232

3333
$$
3434
P(n) = \begin{matrix}
35-
\displaystyle\frac 1 6 &;& n \in [1..6]
35+
\displaystyle\frac 1 6 &;& n \in [\![1,6]\!]
3636
\end{matrix}.
3737
$$
3838
This is saying that the probability of $$n$$ being a whole number between 1 and 6 is $$1/6$$, and we assume that the probability of getting any other $$n$$ is 0.
@@ -48,7 +48,7 @@ So let's go ahead and construct it!
4848
Let's first define the domain of our target $$P(n)$$.
4949
We know that the lowest sum of two dice is 2 (a 1 on both dice), so $$n \geq 2$$ for sure. Similarly, the maximum is the sum of two sixes, or 12, so $$n \leq 12$$ also.
5050

51-
So now we know the domain of possibilities, i.e., $$n \in [2..12]$$.
51+
So now we know the domain of possibilities, i.e., $$n \in [\![2,12]\!]$$.
5252
Next, we take a very common approach - for each outcome $$n$$, we count up the number of different ways it can occur.
5353
Let's call this number the __frequency of n__, $$f(n)$$.
5454
We already mentioned that there is only one way to get $$n=2$$, by getting a pair of 1s.

0 commit comments

Comments
 (0)