diff --git a/semester4/ps/ps-jh/parts/02_discrete-continuous-rv/03_distributions/01_geom.tex b/semester4/ps/ps-jh/parts/02_discrete-continuous-rv/03_distributions/01_geom.tex
index b301c4b..69e2294 100644
--- a/semester4/ps/ps-jh/parts/02_discrete-continuous-rv/03_distributions/01_geom.tex
+++ b/semester4/ps/ps-jh/parts/02_discrete-continuous-rv/03_distributions/01_geom.tex
@@ -1,8 +1,8 @@
 \subsubsection{Geometrische Verteilung}
 {\scriptsize Warten auf den ersten Erfolg (in $\8$ Folge von Bernoulli-Experimenten)}
 
-\shortdefinition $\cX \sim \text{Geom}(p)$ mit $W = \N \backslash \{0\}$ falls\\
-$\forall k \in W \; \P[\cX = k] = (1 - p)^{k - 1} \cdot p$
+\shortdefinition $\cX \sim \text{Geom}(p)$ mit $W = \N \backslash \{0\}$ falls $\forall k \in W$\\
+$\P[\cX = k] = \P[\cX > (k - 1)] \cdot p$ mit $\P[\cX > k] = (1 - p)^{k}$
 
 \shortremark $\P[\cX = 1] = p$, da wir Konvetion $a^0 = 1$ verwenden.
 
@@ -13,5 +13,5 @@ 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\\
+\shorttheorem[Gedächtnislosigkeit] $T \sim \text{Geom}(p)$, dann\\
 $\forall n \geq 0 \; \forall k \geq 1 \; \P[T \geq n + k \divider T > n] = \P[T \geq k]$
diff --git a/semester4/ps/ps-jh/probability-and-statistics-cheatsheet.pdf b/semester4/ps/ps-jh/probability-and-statistics-cheatsheet.pdf
index 729dddd..791c752 100644
Binary files a/semester4/ps/ps-jh/probability-and-statistics-cheatsheet.pdf and b/semester4/ps/ps-jh/probability-and-statistics-cheatsheet.pdf differ