Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
M
mooc-rr
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
f5c490e9182da42b1c30e92aadd353a4
mooc-rr
Commits
c8d941c5
Commit
c8d941c5
authored
May 02, 2020
by
Alexandre Jesus
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Minor fixes
parent
daf6d9d6
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
13 additions
and
14 deletions
+13
-14
toy_document_orgmode_R_en.org
module2/exo1/toy_document_orgmode_R_en.org
+13
-14
No files found.
module2/exo1/toy_document_orgmode_R_en.org
View file @
c8d941c5
...
...
@@ -5,37 +5,36 @@
My computer tells me that $\pi$ is approximately
#+
BEGIN_SRC
R :results output :exports both
#+
begin_src
R :results output :exports both
pi
#+
END_SRC
#+
end_src
#+RESULTS:
: [1] 3.141593
* Buffon's needle
Applying the method of
Buffon's needle
, we get the *approximation*
Applying the method of
[[https://en.wikipedia.org/wiki/Buffon%2527s_needle_problem][Buffon's needle]]
, we get the *approximation*
#+
BEGIN_SRC
R :results output :exports both
#+
begin_src
R :results output :exports both
set.seed(42)
N = 100000
x = runif(N)
theta = pi/2*runif(N)
2/(mean(x+sin(theta)>1))
#+
END_SRC
#+
end_src
#+RESULTS:
: [1] 3.14327
* 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 \le 1] = \pi/4$ (see [[https://en.wikipedia.org/wiki/Monte_Carlo_method]["Monte Carlo method"
on Wikipedia]]). 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 \le 1] = \pi/4$ (see [[https://en.wikipedia.org/wiki/Monte_Carlo_method]["Monte Carlo
method"
on Wikipedia]]). The following code uses this approach
#+BEGIN_SRC R :session *R* :results output graphics :file "./pi.png" :exports both :width 600 :height 400
#+begin_src R :session *R* :results output graphics :file "./pi.png" :exports both :width 600 :height 400
set.seed(42)
N = 1000
df = data.frame(X = runif(N), Y = runif(N))
...
...
@@ -45,7 +44,7 @@ ggplot(df, aes(x=X,y=Y,color=Accept)) +
geom_point(alpha=.2) +
coord_fixed() +
theme_bw()
#+
END_SRC
#+
end_src
#+RESULTS:
[[file:./pi.png]]
...
...
@@ -54,9 +53,9 @@ 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:
#+
BEGIN_SRC
R :session *R* :results output :exports both
#+
begin_src
R :session *R* :results output :exports both
4*mean(df$Accept)
#+
END_SRC
#+
end_src
#+RESULTS:
: [1] 3.156
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment