Update toy_document_en.Rmd

parent 436a3fc1
...@@ -11,12 +11,14 @@ knitr::opts_chunk$set(echo = TRUE) ...@@ -11,12 +11,14 @@ knitr::opts_chunk$set(echo = TRUE)
## Asking the maths library ## Asking the maths library
My computer tells me that $\pi$ is *approximatively* My computer tells me that $\pi$ is *approximatively*
```{r} ```{r}
pi pi
``` ```
## Buffon's needle ## Buffon's needle
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__
```{r} ```{r}
set.seed(42) set.seed(42)
N = 100000 N = 100000
...@@ -27,6 +29,7 @@ theta = pi/2*runif(N) ...@@ -27,6 +29,7 @@ theta = pi/2*runif(N)
## Using a surface fraction argument ## Using a surface fraction argument
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: 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:
```{r} ```{r}
set.seed(42) set.seed(42)
N = 1000 N = 1000
...@@ -34,10 +37,12 @@ df = data.frame(X = runif(N), Y = runif(N)) ...@@ -34,10 +37,12 @@ df = data.frame(X = runif(N), Y = runif(N))
df$Accept = (df$X**2 + df$Y**2 <=1) df$Accept = (df$X**2 + df$Y**2 <=1)
library(ggplot2) library(ggplot2)
ggplot(df, aes(x=X,y=Y,color=Accept)) + geom_point(alpha=.2) + coord_fixed() + theme_bw() ggplot(df, aes(x=X,y=Y,color=Accept)) + geom_point(alpha=.2) + coord_fixed() + theme_bw()
``` ```
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: 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:
```{r} ```{r}
4*mean(df$Accept) 4*mean(df$Accept)
``` ```
When you click on the button **Knit**, the document will be compiled in order to re-execute the R code and to include the results into the final document.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment