Add

simveit · Jul 8, 2024 · d9bb34c · d9bb34c
1 parent 03468d7
commit d9bb34c
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/_posts/2024-07-08-combination-permutation.md b/_posts/2024-07-08-combination-permutation.md
@@ -134,7 +134,7 @@ event = {h for h in hands if h[0].rank == h[1].rank}
 How many elements to be have in the event?
 
 We choose one length and than can choose two suits so we have
-$\#E = {13 \choose 1}{4 \choose 2}$
+#E $ = {13 \choose 1}{4 \choose 2}$
 
 ```python
 len(event) == get_number_k_out_of_n(13,1)*get_number_k_out_of_n(4,2)

diff --git a/_posts/2024-07-08-introduction-probability.md b/_posts/2024-07-08-introduction-probability.md
@@ -49,7 +49,7 @@ event
 {('H', 'H', 'H'), ('H', 'H', 'T'), ('H', 'T', 'H'), ('T', 'H', 'H')}
 ```
 The *frequentist* approach states the following:
-If all possible outcomes are equally likely an event E occurs with frequency $\#E/\#S$ where $\#E$ is the number of elements in the Event and #S is the number of elements in the State Space.
+If all possible outcomes are equally likely an event E occurs with frequency #E/#S where #E is the number of elements in the Event and #S is the number of elements in the State Space.
 For our particular example we can do it very simply in Python.
 
 ```python