benchmarks.wiki / Public workspace

Omni-MATH / Suppose two distinct competitors of the HMMT 2021 November contest are chosen…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Suppose two distinct competitors of the HMMT 2021 November contest are chosen uniformly at random. Let pp be the probability that they can be labelled AA and BB so that AA 's score on the General round is strictly greater than BB 's, and BB 's score on the theme round is strictly greater than AA 's. Estimate P=⌊10000p⌋P=\lfloor 10000 p\rfloor. An estimate of EE will earn ⌊20min(AE,EA)6⌋\left\lfloor 20 \min \left(\frac{A}{E}, \frac{E}{A}\right)^{6}\right\rfloor points.
Plain-text mathematical notation (without MathML)
Suppose two distinct competitors of the HMMT 2021 November contest are chosen uniformly at random. Let p be the probability that they can be labelled A and B so that A 's score on the General round is strictly greater than B 's, and B 's score on the theme round is strictly greater than A 's. Estimate P=⌊10000p⌋. An estimate of E will earn ⌊20min((A)/(E),(E)/(A))⁶⌋ points.
Original LaTeX notation
Suppose two distinct competitors of the HMMT 2021 November contest are chosen uniformly at random. Let $p$ be the probability that they can be labelled $A$ and $B$ so that $A$ 's score on the General round is strictly greater than $B$ 's, and $B$ 's score on the theme round is strictly greater than $A$ 's. Estimate $P=\lfloor 10000 p\rfloor$. An estimate of $E$ will earn $\left\lfloor 20 \min \left(\frac{A}{E}, \frac{E}{A}\right)^{6}\right\rfloor$ points.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import