"My computer tells me that $\\pi$ is *approximatively*"
"My computer tells me that $\\pi$ is *approximatively*"
]
]
},
},
...
@@ -32,7 +33,7 @@
...
@@ -32,7 +33,7 @@
"metadata": {},
"metadata": {},
"source": [
"source": [
"## Buffon’s needle\n",
"## Buffon’s needle\n",
"Applying the method of [Buffon’s needle](https://en.wikipedia.org/wiki/Buffon%27s_needle_problem), we get the **approximation**"
"Applying the method of [Buffon’s needle](https://en.wikipedia.org/wiki/Buffon%27s_needle_problem), we get the __approximation__"
]
]
},
},
{
{
...
@@ -65,12 +66,12 @@
...
@@ -65,12 +66,12 @@
"metadata": {},
"metadata": {},
"source": [
"source": [
"## Using a surface fraction argument\n",
"## Using a surface fraction argument\n",
"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:"
"A method that is easier to understand and does not make use of the sin function is based on the fact that if $X\\sim U(0,1)$ and $Y\\sim U(0,1)$, then $P[X^2+Y^2\\leq 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",
"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:"
"many times, on average, $X^2 + Y^2$ is smaller than 1:"