diff --git a/doc/pub/DecisionTrees/html/._DecisionTrees-bs018.html b/doc/pub/DecisionTrees/html/._DecisionTrees-bs018.html
index b8afc2173..e64429d24 100644
--- a/doc/pub/DecisionTrees/html/._DecisionTrees-bs018.html
+++ b/doc/pub/DecisionTrees/html/._DecisionTrees-bs018.html
@@ -292,7 +292,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
index b65e88beb..bd2ee0e2e 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
@@ -732,7 +732,7 @@ C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}
 $$
 <p>&nbsp;<br>
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
index a28aaf946..459eb8786 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
@@ -777,7 +777,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees.html b/doc/pub/DecisionTrees/html/DecisionTrees.html
index 9d22847ca..d5c2e9db6 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees.html
@@ -782,7 +782,7 @@ $$
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 $$
 
-where \( G_{\mathrm{left\left}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
+where \( G_{\mathrm{left/right}} \) measures the impurity of the left/right subset  and \( m_{\mathrm{left/right}} \)
  is the number of instances in the left/right subset
 
 <p>
diff --git a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
index aaf2eaca4..6c148c375 100644
--- a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
+++ b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
@@ -637,7 +637,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "where $G_{\\mathrm{left\\left}}$ measures the impurity of the left/right subset  and $m_{\\mathrm{left/right}}$\n",
+    "where $G_{\\mathrm{left/right}}$ measures the impurity of the left/right subset  and $m_{\\mathrm{left/right}}$\n",
     " is the number of instances in the left/right subset\n",
     "\n",
     "Once it has successfully split the training set in two, it splits the subsets using the same logic, then the subsubsets\n",
diff --git a/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz b/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz
index c08f488f1..5a661c8ab 100644
Binary files a/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz and b/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz differ
diff --git a/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf b/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf
index 6d8201a6e..19805ea0b 100644
Binary files a/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf and b/doc/pub/DecisionTrees/pdf/DecisionTrees-minted.pdf differ
diff --git a/doc/src/DecisionTrees/DecisionTrees.do.txt b/doc/src/DecisionTrees/DecisionTrees.do.txt
index c6f31cbd8..9b4450407 100644
--- a/doc/src/DecisionTrees/DecisionTrees.do.txt
+++ b/doc/src/DecisionTrees/DecisionTrees.do.txt
@@ -490,7 +490,7 @@ The cost function it tries to minimize is then
 C(k,t_k) = \frac{m_{\mathrm{left}}}{m}G_{\mathrm{left}}+ \frac{m_{\mathrm{right}}}{m}G_{\mathrm{right}},
 \]
 !et
-where $G_{\mathrm{left\left}}$ measures the impurity of the left/right subset  and $m_{\mathrm{left/right}}$
+where $G_{\mathrm{left/right}}$ measures the impurity of the left/right subset  and $m_{\mathrm{left/right}}$
  is the number of instances in the left/right subset
 
 Once it has successfully split the training set in two, it splits the subsets using the same logic, then the subsubsets