Compare commits
6 Commits
2259ce1bcb
...
9993a8f286
Author | SHA1 | Date | |
---|---|---|---|
9993a8f286 | |||
ccaa3bd876 | |||
e9024d1f82 | |||
6048e6d5ee | |||
61a43e11ec | |||
4e2b6ec7e3 |
@ -13,7 +13,7 @@
|
||||
#show: doc => handout(
|
||||
doc,
|
||||
group: "Advanced 2",
|
||||
title: [Fast Inverse Root],
|
||||
title: [Fast Inverse Square Root],
|
||||
by: "Mark",
|
||||
)
|
||||
|
||||
|
@ -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}
|
||||
|
@ -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([
|
||||
|
Loading…
x
Reference in New Issue
Block a user