We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3dcbd04 commit 6b0b1f8Copy full SHA for 6b0b1f8
1 file changed
src/chapters/3/sections/named_distributions/problems/15.tex
@@ -1,2 +1,8 @@
1
-$$F(X = k) = P(X \leq k) = \sum_{i=1}^{k}P(X = i) = \sum_{i=1}^{k} \frac{1}{n} =
2
-\frac{k}{n}.$$
+\[ F_X(x) = P(X \le x) = \begin{cases}
+ 0 &, \text{ if } x < 1\\
3
+ \frac{\lfloor x \rfloor}{n} &, \text{ if } 1 \le x \le n\\
4
+ 1 &, \text{ if } x > n
5
+ \end{cases}
6
+\]
7
+
8
+where $\lfloor x \rfloor$ equals the largest integer that is less than or equal to $x$ .
0 commit comments