benchmarks.wiki / Public workspace

MMLU / Let n be the product of the two smallest 3-digit prime numbers. Find the sum…

Problem

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

question

Let nn be the product of the two smallest 3-digit prime numbers. Find the sum of the digits of nn.
Plain-text mathematical notation (without MathML)
Let n be the product of the two smallest 3-digit prime numbers. Find the sum of the digits of n.
Original LaTeX notation
Let $n$ be the product of the two smallest 3-digit prime numbers. Find the sum of the digits of $n$.

choices

  1. 8
  2. 3
  3. 6
  4. 9

subject

high_school_mathematics

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