[PS] Small fixes

This commit is contained in:
2026-03-16 16:16:15 +01:00
parent b2941c45a6
commit 181753782d
2 changed files with 3 additions and 2 deletions
@@ -21,14 +21,15 @@ $\forall k \in W \; \P[\cX = k] = (1 - p)^{k - 1} \cdot p$
\shortremark $\P[\cX = 1] = p$, da wir Konvetion $a^0 = 1$ verwenden.
\shortremark $\sum_{k = 0}^{\8} p(k) = p \cdot \sum_{k = 0}^{\8} \P[\cX = k] = p \cdot \frac{1}{p} = 1$
\shortremark $\sum_{k = 0}^{\8} p(k) = p \cdot \sum_{k = 0}^{\8} (1 - p)^{k - 1} = p \cdot \frac{1}{p} = 1$
\shorttheorem $X_i \sim \text{Ber}(p)$ für $i \in \N$.\\
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]$
\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]$
\subsubsection{Poisson-Verteilung}