From 1934e4f8d673ad55cb932c6b9cd21068a64e6d80 Mon Sep 17 00:00:00 2001
From: 06295db534a9872198b1363b8b12f920
 <06295db534a9872198b1363b8b12f920@app-learninglab.inria.fr>
Date: Thu, 6 Mar 2025 14:45:34 +0000
Subject: [PATCH] test

---
 module2/exo1/toy_notebook_en.ipynb | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/module2/exo1/toy_notebook_en.ipynb b/module2/exo1/toy_notebook_en.ipynb
index 7580ee9..022d9b9 100644
--- a/module2/exo1/toy_notebook_en.ipynb
+++ b/module2/exo1/toy_notebook_en.ipynb
@@ -70,7 +70,7 @@
     "## 1.3 Using a surface fraction argument\n",
     "\n",
     "A method that is easier to understand and does not make use of the sin function is based on the\n",
-    "fact that if *X ∼ U(0, 1)* and *Y ∼ U(0, 1)* then P[X<sup>2</sup> + Y<sup>2</sup> ≤ 1] = &#960;/4 (see [\"Monte Carlo method\"\n",
+    "fact that if *X ∼ U(0, 1)* and *Y ∼ U(0, 1)* then P[X² + Y² ≤ 1] = &#960;/4 (see [\"Monte Carlo method\"\n",
     "on Wikipedia](https://en.wikipedia.org/wiki/Monte_Carlo_method)). The following code uses this approach:"
    ]
   },
@@ -115,7 +115,7 @@
    "outputs": [],
    "source": [
     "It is then straightforward to obtain a (not really good) approximation to π by counting how\n",
-    "many times, on average, X<sup>2</sup> + Y<sup>2</sup> is smaller than 1:"
+    "many times, on average, X² + Y² is smaller than 1:"
    ]
   },
   {
-- 
2.18.1