diff --git a/module2/exo1/toy_notebook_fr.ipynb b/module2/exo1/toy_notebook_fr.ipynb
index 0bbbe371b01e359e381e43239412d77bf53fb1fb..8b1bbb3ab823f7b37443278803d51312fc42ed58 100644
--- a/module2/exo1/toy_notebook_fr.ipynb
+++ b/module2/exo1/toy_notebook_fr.ipynb
@@ -1,5 +1,132 @@
 {
- "cells": [],
+ "cells": [
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "# toy_notebook_fr"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "## date"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "###   1. À propos du calcul de π"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "#### **1.1 En demandant à la lib maths**"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "Mon ordinateur m’indique que *π* vaut *approximativement*"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "from math import *\n",
+    "print(pi)"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "#### **1.2 En utilisant la méthode des aiguilles de Buffon**"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "Mais calculé avec la méthode des [aiguilles de Buffon](https://fr.wikipedia.org/wiki/Aiguille_de_Buffon), on obtiendrait comme *approximation* :"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import numpy as np\n",
+    "np.random.seed(seed=42)\n",
+    "N = 10000\n",
+    "x = np.random.uniform(size=N, low=0, high=1)\n",
+    "theta = np.random.uniform(size=N, low=0, high=pi/2)\n",
+    "2/(sum((x+np.sin(theta))>1)/N)"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "#### **1.3 Avec un argument \"fréquentiel\" de surface**"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "Sinon, une méthode plus simple à comprendre et ne faisant pas intervenir d’appel à la fonction sinus se base surle fait que si $X∼U(0,1)$ et $Y∼U(0,1)$ alors $P[X^2+Y^2 ≤1] = π/4$ [(voir méthode de Monte Carlo sur Wikipedia)](https://fr.wikipedia.org/wiki/Méthode_de_Monte-Carlo#Détermination_de_la_valeur_de_π). Le code suivant illustre ce fait :"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "scrolled": true
+   },
+   "outputs": [],
+   "source": [
+    "%matplotlib inline\n",
+    "import matplotlib.pyplot as plt\n",
+    "np.random.seed(seed=42)\n",
+    "\n",
+    "N = 1000\n",
+    "x = np.random.uniform(size=N, low=0, high=1)\n",
+    "y = np.random.uniform(size=N, low=0, high=1)\n",
+    "accept = (x*x+y*y) <= 1\n",
+    "reject = np.logical_not(accept)\n",
+    "fig, ax = plt.subplots(1)\n",
+    "ax.scatter(x[accept], y[accept], c='b', alpha=0.2, edgecolor=None)\n",
+    "ax.scatter(x[reject], y[reject], c='r', alpha=0.2, edgecolor=None)\n",
+    "ax.set_aspect('equal')\n"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "Il est alors aisé d’obtenir une approximation (pas terrible) de *π* en comptant combien de fois, en moyenne, $X^2 + Y^2$ est inférieur à 1 :"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "4*np.mean(accept)"
+   ]
+  }
+ ],
  "metadata": {
   "kernelspec": {
    "display_name": "Python 3",
@@ -16,10 +143,9 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.6.3"
+   "version": "3.6.4"
   }
  },
  "nbformat": 4,
  "nbformat_minor": 2
 }
-