diff --git a/doc/pub/DecisionTrees/html/._DecisionTrees-bs042.html b/doc/pub/DecisionTrees/html/._DecisionTrees-bs042.html
index d4c0e951a..118c2378e 100644
--- a/doc/pub/DecisionTrees/html/._DecisionTrees-bs042.html
+++ b/doc/pub/DecisionTrees/html/._DecisionTrees-bs042.html
@@ -282,7 +282,7 @@ MathJax.Hub.Config({
 The algorithm described here can be applied to both classification and regression problems.
 
 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.
 
 <ol>
 <li> For \( b=1:B \)</li>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
index 64b17ab31..bc5b23481 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees-reveal.html
@@ -1900,7 +1900,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.
 
 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.
 
 <ol>
 <p><li> For \( b=1:B \)</li>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
index cc7d97d36..3acb592b8 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees-solarized.html
@@ -1919,7 +1919,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.
 
 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.
 
 <ol>
 <li> For \( b=1:B \)</li>
diff --git a/doc/pub/DecisionTrees/html/DecisionTrees.html b/doc/pub/DecisionTrees/html/DecisionTrees.html
index 4c136f88f..9f10b9c70 100644
--- a/doc/pub/DecisionTrees/html/DecisionTrees.html
+++ b/doc/pub/DecisionTrees/html/DecisionTrees.html
@@ -1924,7 +1924,7 @@ this setting.
 The algorithm described here can be applied to both classification and regression problems.
 
 <p>
-We will grow of forest of say \( M \) trees.
+We will grow of forest of say \( B \) trees.
 
 <ol>
 <li> For \( b=1:B \)</li>
diff --git a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
index 2a7a30dba..bb33c0a10 100644
--- a/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
+++ b/doc/pub/DecisionTrees/ipynb/DecisionTrees.ipynb
@@ -1952,7 +1952,7 @@
     "## Random Forest Algorithm\n",
     "The algorithm described here can be applied to both classification and regression problems.\n",
     "\n",
-    "We will grow of forest of say $M$ trees.\n",
+    "We will grow of forest of say $B$ trees.\n",
     "1. For $b=1:B$\n",
     "\n",
     "  * Draw a bootstrap sample of from the training data organized in our $\\boldsymbol{X}$ matrix.\n",
diff --git a/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz b/doc/pub/DecisionTrees/ipynb/ipynb-DecisionTrees-src.tar.gz
index bcf32e0b9..73c4fbde1 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 52ca6827c..dfe40beec 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 bc4b03864..2b28ffbcd 100644
--- a/doc/src/DecisionTrees/DecisionTrees.do.txt
+++ b/doc/src/DecisionTrees/DecisionTrees.do.txt
@@ -1559,7 +1559,7 @@ this setting.
 ===== Random Forest Algorithm =====
 The algorithm described here can be applied to both classification and regression problems.
 
-We will grow of forest of say $M$ trees.
+We will grow of forest of say $B$ trees.
 o For $b=1:B$
   * Draw a bootstrap sample of from the training data organized in our $\bm{X}$ matrix.
   * We grow then a random forest tree $T_b$ based on the bootstrapped data by repeating the steps outlined till we reach the maximum node size is reached