benchmarks.wiki / Public workspace

MMLU-Pro / 10465 / Let X be uniformly distributed over {1,2,…,256}. We ask random…

Problem

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

question

Let XX be uniformly distributed over {1,2,…,256}\{1, 2, \ldots, 256\}. We ask random questions: Is X∈S1X\in S_1? Is X∈S2X\in S_2? ... until only one integer remains. All 22562^256 subsets of {1,2,…,256}\{1, 2, \ldots, 256\} are equally likely. How many deterministic questions are needed to determine XX?
Plain-text mathematical notation (without MathML)
Let X be uniformly distributed over {1,2,…,256}. We ask random questions: Is X∈S₁? Is X∈S₂? ... until only one integer remains. All 2²56 subsets of {1,2,…,256} are equally likely. How many deterministic questions are needed to determine X?
Original LaTeX notation
Let $X$ be uniformly distributed over $\{1, 2, \ldots, 256\}$. We ask random questions: Is $X\in S_1$? Is $X\in S_2$? ... until only one integer remains. All $2^256$ subsets of $\{1, 2, \ldots, 256\}$ are equally likely. How many deterministic questions are needed to determine $X$?

category

computer science

options

  1. 1024
  2. 64
  3. 1
  4. 512
  5. 8
  6. 16
  7. 4
  8. 32
  9. 256
  10. 128

src

theoremQA-EECS

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