Compare commits

..

5 Commits

Author SHA1 Message Date
2259ce1bcb Finish main sections
Some checks failed
CI / Typst formatting (pull_request) Successful in 5s
CI / Typos (pull_request) Failing after 11s
CI / Build (pull_request) Has been skipped
2025-02-10 19:43:56 -08:00
ba374a5ee2 Fix header 2025-02-10 19:29:49 -08:00
8ef2d1cae8
FIR draft
Some checks failed
CI / Typos (pull_request) Failing after 7s
CI / Typst formatting (pull_request) Successful in 5s
CI / Build (pull_request) Has been skipped
2025-02-10 09:41:05 -08:00
126dd70d70
Tweak lib 2025-02-10 09:41:01 -08:00
fb65744ee9 Added generic object to typst 2025-02-09 20:17:34 -08:00
3 changed files with 3 additions and 6 deletions

View File

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

View File

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

View File

@ -13,10 +13,7 @@ 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. \
- 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?
What is the optimal strategy, and what is its probability of guessing correctly?
#solution([