Compare commits

..

6 Commits

Author SHA1 Message Date
9993a8f286
Added "Fast Inverse Root"
Some checks failed
CI / Typos (pull_request) Failing after 12s
CI / Typst formatting (pull_request) Successful in 8s
CI / Build (pull_request) Has been skipped
2025-02-11 10:09:58 -08:00
ccaa3bd876
Fixed handout header 2025-02-11 10:09:37 -08:00
e9024d1f82
Added instructornote and if_solutions_else 2025-02-11 10:09:24 -08:00
6048e6d5ee
Added generic object to typst 2025-02-11 10:08:45 -08:00
61a43e11ec Fix solutions
All checks were successful
CI / Typst formatting (push) Successful in 6s
CI / Typos (push) Successful in 7s
CI / Build (push) Successful in 9m42s
2025-02-10 09:09:40 -08:00
4e2b6ec7e3 Edit "Somewhat Random Numbers"
All checks were successful
CI / Typst formatting (push) Successful in 4s
CI / Typos (push) Successful in 13s
CI / Build (push) Successful in 9m25s
2025-02-10 08:47:51 -08:00
3 changed files with 6 additions and 3 deletions

View File

@ -13,7 +13,7 @@
#show: doc => handout(
doc,
group: "Advanced 2",
title: [Fast Inverse Root],
title: [Fast Inverse Square Root],
by: "Mark",
)

View File

@ -1,7 +1,7 @@
% use [nosolutions] flag to hide solutions.
% use [solutions] flag to show solutions.
\documentclass[
nosolutions,
solutions,
singlenumbering,
shortwarning
]{../../../lib/tex/ormc_handout}

View File

@ -13,7 +13,10 @@ Bob generates 101 random numbers from $[0, 1]$, but deletes the lowest result.
Say we have both of the resulting arrays, but do not know who generated each one. \
We would like to guess which of the two was generated by Bob. \
What is the optimal strategy, and what is its probability of guessing correctly?
- Say we assign the array with the smallest mean to Alice. \
What is our probability of guessing correctly?
- How often do we guess correctly if we instead assign \
the array with the smaller _minimum_ to Alice?
#solution([