Added math labels to posts that use mathjax

content/blog/2017-03-14-monte-carlo-pi.md

@@ -21,6 +21,7 @@ mf2_syndication:
 format: aside
 kind:
   - note
+math: true
 ---
 Using Monte Carlo methods, we can create a simulation that approximates pi. In this post, we will go over the math behind the approximation and the code.
 
@@ -126,4 +127,4 @@ We found an approximation of pi using the Monte Carlo methods! I find that reall
 
 1) We don’t keep track of double counting. One possible solution for this is increasing the radius and bounding box appropriately so that the probability of double counting is low.
 
-2) Speed. The more trials you ask it to run, the longer it takes to perform all of the simulations. One possible way around this is to write a parrallel version of this code. That’s possible because of the equal variance that we spoke of earlier. Pooling the successses and trials will still result in a good approximation.
+2) Speed. The more trials you ask it to run, the longer it takes to perform all of the simulations. One possible way around this is to write a parrallel version of this code. That’s possible because of the equal variance that we spoke of earlier. Pooling the successses and trials will still result in a good approximation.

content/blog/abstractdef.md

@@ -3,6 +3,7 @@ title: "Useful Abstract Definitions"
 date: 2019-10-27T23:49:57-04:00
 draft: false
 tags: [ "abstract algebra" ]
+math: true
 ---
 
 ## Chapter 17

content/blog/cryptogames.md

@@ -2,6 +2,7 @@
 title: "Cryptographic Games"
 date: 2020-01-13T21:35:09-05:00
 draft: false
+math: true
 ---
 
 When analyzing cryptographic algorithms, we characterize the strength of the crypto-system by analyzing what happens in various crypto games. Below are a couple examples of crypto games used in literature.

content/blog/groupssimplified.md

@@ -3,6 +3,7 @@ title: "Groups Simplified"
 date: 2019-12-10T21:40:00-05:00
 draft: false 
 tags: [ "abstract algebra" ]
+math: true
 ---
 
 This post is inspired by the book "Term Rewriting & All That" by Franz Baader and Tobias Nipkow.

content/blog/proofdef.md

@@ -3,6 +3,7 @@ title: "Theorem Proving Definitions"
 date: 2019-12-29T11:21:07-05:00
 draft: false
 images: []
+math: true
 ---
 
 When I look into a new field, sometimes I get confused by the whole new set of vocab terms I need to encounter. This post will serve to keep me straight with the terms involved in theorem proving. 
@@ -14,4 +15,4 @@ When I look into a new field, sometimes I get confused by the whole new set of v
 | Decidable    | An effective method exists for deriving the correct answer in a finite time. |
 | Sound        | Every formula that can be proved in the system is logically valid with respect to the semantics of the system. (i.e The system does not produce a wrong result) |
 
-Hopefully, I'll come back and add more terms as I get confused.
+Hopefully, I'll come back and add more terms as I get confused.

content/blog/pythonsymmetricgroups.md

@@ -3,6 +3,7 @@ title: "Symmetric Groups in Python"
 date: 2019-05-22T20:02:21-04:00
 draft: false
 tags: [ "abstract algebra" ]
+math: true
 ---
 
 **Warning:** This post is meant for someone whose familiar with concepts of Abstract Algebra.

content/blog/rsa.md

@@ -3,6 +3,7 @@ title: RSA Cryptography
 date: 2019-12-10T22:15:21-05:00
 draft: false
 images: []
+math: true
 ---
 
 # Introduction