benchmarks.wiki / Public workspace

MMLU-Pro / 7886 / An urn contains four balls numbered 1 through 4 . The balls are selected one at…

Problem

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

question

An urn contains four balls numbered 1 through 4 . The balls are selected one at a time without replacement. A match occurs if the ball numbered mm is the mm th ball selected. Let the event AiA_i denote a match on the ii th draw, i=1,2,3,4i=1,2,3,4. Extend this exercise so that there are nn balls in the urn. What is the limit of this probability as nn increases without bound?
Plain-text mathematical notation (without MathML)
An urn contains four balls numbered 1 through 4 . The balls are selected one at a time without replacement. A match occurs if the ball numbered m is the m th ball selected. Let the event A_(i) denote a match on the i th draw, i=1,2,3,4. Extend this exercise so that there are n balls in the urn. What is the limit of this probability as n increases without bound?
Original LaTeX notation
An urn contains four balls numbered 1 through 4 . The balls are selected one at a time without replacement. A match occurs if the ball numbered $m$ is the $m$ th ball selected. Let the event $A_i$ denote a match on the $i$ th draw, $i=1,2,3,4$. Extend this exercise so that there are $n$ balls in the urn. What is the limit of this probability as $n$ increases without bound?

category

math

options

  1. $1 - \frac{1}{e}$
  2. $\frac{1}{e}$
  3. $\frac{1}{n!}$
  4. $\frac{1}{\sqrt{n}}$
  5. $\frac{1}{4}$
  6. $\frac{2}{e}$
  7. $\frac{1}{2}$
  8. $e^{-1/n}$
  9. $\frac{n-1}{n}$
  10. $\frac{1}{n}$

src

scibench-stat

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import