fix typo: mod m -> mod n

diksown · adamant-pwn · commit 5d270c569517 · 2022-10-17T13:22:19.000+02:00
diff --git a/src/others/josephus_problem.md b/src/others/josephus_problem.md
@@ -77,7 +77,7 @@ int josephus(int n, int k) {
 This formula can also be found analytically.
 Again here we assume 0-indexing.
 After we delete the first number, we have $n-1$ numbers left.
-When we repeat the procedure, we will start with the number that had originally the index $k \bmod m$.
+When we repeat the procedure, we will start with the number that had originally the index $k \bmod n$.
 $J_{n-1, k}$ would be the answer for the remaining circle, if we start counting at $0$, but because we actually start with $k$ we have $J_{n, k} = (J_{n-1,k} + k) \ \bmod n$.
 
 ## Modeling a $O(k \log n)$ solution
