mirror of
https://github.com/janishutz/eth-summaries.git
synced 2026-04-28 16:19:23 +02:00
[PS] Some fixes
This commit is contained in:
@@ -14,4 +14,4 @@ Dann $( T := \min\{ n \geq 1 \divider X_n = 1 \} )\sim \text{Geom}(p)$
|
||||
\shortremark $T = \8$ ist möglich, $\P[T = \8] = 0$
|
||||
|
||||
\shorttheorem $T \sim \text{Geom}(p)$, dann\\
|
||||
$\forall n \geq 0 \; \forall k \geq 1 \; \P[T \geq n + k | T > n] = \P[T \geq k]$
|
||||
$\forall n \geq 0 \; \forall k \geq 1 \; \P[T \geq n + k \divider T > n] = \P[T \geq k]$
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
|
||||
\subsubsection{Gleichverteilung}
|
||||
|
||||
\shortdefinition $\cX \sim \cU([a, b])$, f
|
||||
\shortdefinition $\cX \sim \cU([a, b])$, falls
|
||||
$f_\cX = \begin{cases}
|
||||
\frac{1}{b - a} & x \in [a, b] \\
|
||||
0 & \text{sonst}
|
||||
|
||||
@@ -7,7 +7,7 @@ $\forall x \in \R f_\cX(x) = \begin{cases}
|
||||
0 & x < 0
|
||||
\end{cases}$
|
||||
|
||||
\shortremark[Gedächtnisl.] $\P[\cX > t + s | \cX > s] = \P[\cX > t]$
|
||||
\shortremark[Gedächtnisl.] $\P[\cX > t + s \divider \cX > s] = \P[\cX > t]$
|
||||
|
||||
\shortremark[Verteilungsfunktion] $F_\cX(x) = \begin{cases}
|
||||
1 - e^{-\lambda x} & x \geq 0 \\
|
||||
|
||||
Binary file not shown.
Reference in New Issue
Block a user