benchmarks.wiki / Public workspace

MATH / How many non-empty subsets of {1,2,3,4,5,6,7,8,9,10,11} consist entirely of prime numbers? (We form a subset of the group of numbers by choosing some number of them, without regard…

Problem

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

problem

How many non-empty subsets of {1,2,3,4,5,6,7,8,9,10,11}\{ 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 \} consist entirely of prime numbers? (We form a subset of the group of numbers by choosing some number of them, without regard to order. So, {1,2,3}\{1,2,3\} is the same as {3,1,2}\{3,1,2\}.)
Plain-text mathematical notation (without MathML)
How many non-empty subsets of {1,2,3,4,5,6,7,8,9,10,11} consist entirely of prime numbers?  (We form a subset of the group of numbers by choosing some number of them, without regard to order.  So, {1,2,3} is the same as {3,1,2}.)
Original LaTeX notation
How many non-empty subsets of $\{ 1 , 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 \}$ consist entirely of prime numbers?  (We form a subset of the group of numbers by choosing some number of them, without regard to order.  So, $\{1,2,3\}$ is the same as $\{3,1,2\}$.)

level

Level 4

type

Counting & Probability

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