diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2026-03-18 13:18:41 +0100 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2026-03-18 13:18:41 +0100 |
| commit | fbd9bfb4c17cfaa60465da0df468f1171f8ff776 (patch) | |
| tree | a46d7aaf7e289674b9a5a82b08cc6f914753923c /content/math | |
| parent | 3aa6577ef015cf04e7294553599f63e1572e58f6 (diff) | |
update
Diffstat (limited to 'content/math')
| -rw-r--r-- | content/math/math.tex | 2 | ||||
| -rw-r--r-- | content/math/tables/nim.tex | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/content/math/math.tex b/content/math/math.tex index c303e85..162c7cc 100644 --- a/content/math/math.tex +++ b/content/math/math.tex @@ -426,7 +426,7 @@ $1,~1,~2,~5,~14,~42,~132,~429,~1430,~4862,~16796,~58786,~208012,~742900$ \item Anzahl an Klammerausdrücken mit $n+k$ Klammerpaaren, die mit $\texttt{(}^k$ beginnen.
\end{itemize}
\[C^k_0 = 1\qquad C^k_n = \sum\limits_{\mathclap{a_0+a_1+\dots+a_k=n}} C_{a_0}C_{a_1}\cdots C_{a_k} =
-\frac{k+1}{n+k+1}\binom{2n+k}{n} = \frac{(2n+k-1)\cdot(2n+k)}{n(n+k+1)} \cdot C_{n-1}\]
+\frac{k+1}{n+k+1}\binom{2n+k}{n} = \frac{(2n+k-1)\cdot(2n+k)}{n(n+k+1)} \cdot C^k_{n-1}\]
\paragraph{\textsc{Euler}-Zahlen 1. Ordnung:}
$|~1~|~1~|~1,~1~|~1,~4,~1~|~1,~11,~11,~1~|~1,~26,~66,~26,~1~|$
diff --git a/content/math/tables/nim.tex b/content/math/tables/nim.tex index 66e289e..5a196e5 100644 --- a/content/math/tables/nim.tex +++ b/content/math/tables/nim.tex @@ -86,7 +86,7 @@ \textsc{Kayles}' Nim:\newline Zwei mögliche Züge:\newline - 1) Nehme beliebige Zahl.\newline + 1) Nehme $1$ oder $2$.\newline 2) Teile Stapel in zwei Stapel (mit Entnahme).& Berechne $\mathit{SG}_n$ für kleine $n$ rekursiv.\newline $n \in [72,83]: \quad 4, 1, 2, 8, 1, 4, 7, 2, 1, 8, 2, 7$\newline |