benchmarks.wiki / Public workspace

MMLU-Pro / 7864 / An ordinary deck of cards containing 26 red cards and 26 black cards is shuffled…

Problem

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

question

An ordinary deck of cards containing 26 red cards and 26 black cards is shuffled and dealt out one card at a time without replacement. Let XiX_i be the color of the iith card. Compute H(X1,X2,…,X52)H(X_1,X_2,\ldots,X_{52}) in bits.
Plain-text mathematical notation (without MathML)
An ordinary deck of cards containing 26 red cards and 26 black cards is shuffled and dealt out one card at a time without replacement. Let X_(i) be the color of the ith card. Compute H(X₁,X₂,…,X₅₂) in bits.
Original LaTeX notation
An ordinary deck of cards containing 26 red cards and 26 black cards is shuffled and dealt out one card at a time without replacement. Let $X_i$ be the color of the $i$th card. Compute $H(X_1,X_2,\ldots,X_{52})$ in bits.

category

math

options

  1. 53.2
  2. 50.2
  3. 47.3
  4. 46.5
  5. 51.5
  6. 50.0
  7. 49.9
  8. 45.6
  9. 48.8
  10. 52

src

theoremQA-Math

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