"My computer tells me that $\\pi$ is _approximatively_"
]
},
...
...
@@ -39,7 +38,6 @@
"metadata": {},
"source": [
"## Buffon’s needle\n",
"\n",
"Applying the method of [Buffon’s needle](https://en.wikipedia.org/wiki/Buffon%27s_needle_problem), we get the __approximation__"
]
},
...
...
@@ -73,10 +71,7 @@
"metadata": {},
"source": [
"## 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^2 + Y^2 ≤ 1] = \\pi/4$ (see [\"Monte Carlo method\"\n",
"on Wikipedia](https://en.wikipedia.org/wiki/Monte_Carlo_method)). The following code uses this approach:"
"A method that is easier to understand and does not make use of the sin function is based on the fact that if $X ∼ U(0, 1)$ and $Y ∼ U(0, 1)$, then $P[X^2 + Y^2 ≤ 1] = \\pi/4$ (see [\"Monte Carlo method\" on Wikipedia](https://en.wikipedia.org/wiki/Monte_Carlo_method)). The following code uses this approach:"
"It is then straightforward to obtain a (not really good) approximation to \\pi by counting how\n",
"many times, on average, $X^2 + Y^2$ is smaller than 1:"
"It is then straightforward to obtain a (not really good) approximation to \\pi by counting how many times, on average, $X^2 + Y^2$ is smaller than 1:"