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
06295db534a9872198b1363b8b12f920
mooc-rr
Commits
444ca4c9
Commit
444ca4c9
authored
Mar 06, 2025
by
06295db534a9872198b1363b8b12f920
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
test
parent
1934e4f8
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
toy_notebook_en.ipynb
module2/exo1/toy_notebook_en.ipynb
+2
-2
No files found.
module2/exo1/toy_notebook_en.ipynb
View file @
444ca4c9
...
...
@@ -70,7 +70,7 @@
"## 1.3 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² + Y² ≤ 1] = π/4
(see [\"Monte Carlo method\"\n",
"fact that if *X ∼ U(0, 1)* and *Y ∼ U(0, 1)* then
*P[X² + Y² ≤ 1] = π/4*
(see [\"Monte Carlo method\"\n",
"on Wikipedia](https://en.wikipedia.org/wiki/Monte_Carlo_method)). The following code uses this approach:"
]
},
...
...
@@ -115,7 +115,7 @@
"outputs": [],
"source": [
"It is then straightforward to obtain a (not really good) approximation to π by counting how\n",
"many times, on average,
X² + Y²
is smaller than 1:"
"many times, on average,
*X² + Y²*
is smaller than 1:"
]
},
{
...
...
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