benchmarks.wiki

benchmarks.wiki / Public workspace

MATH / A committee is to be made up from a group of 10 candidates. The committee must…

Problem

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

problem

A committee is to be made up from a group of 10 candidates. The committee must consist of a chairman and some (not necessarily nonzero) number of members-at-large. How many ways can the committee be chosen? (For example, suppose that Alex is chair while Betty, Carl, and D'Angelo make up the committee. This counts as the same as Alex being chair while Carl, Betty, and D'Angelo make up the committee. It is not the same as Betty being the chair, with Alex, Carl, and D'Angelo making up the committee. It is also not the same as Alex being chair with the committee consisting of Betty and Carl.)

level

Level 5

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

task_id
30a49b68-df57-57a6-ac44-6564a95d8b25
task_key
counting~5fand~5fprobability--test--30a49b68-df57-57a6-ac44-6564a95d8b25
task_revision_id
1
config / split
counting_and_probability / test

Official source

initial import