2007 AMC 10A Problems/Problem 12

Revision as of 13:31, 6 January 2008 by Azjps (talk | contribs) (create)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Two tour guides are leading six tourists. The guides decide to split up. Each tourist must choose one of the guides, but with the stipulation that each guide must take at least one tourist. How many different groupings of guides and tourists are possible?

$\text{(A)}\ 56 \qquad \text{(B)}\ 58 \qquad \text{(C)}\ 60 \qquad \text{(D)}\ 62 \qquad \text{(E)}\ 64$

Solution

Each tourist has to pick in between the $2$ guides, so for $6$ tourists there are $2^6$ possible groupings. However, since each guide must take at least one tourist, we subtract the $2$ cases where a guide has no tourist. Thus the answer is $2^6 - 2 = 62\ \mathrm{(D)}$.

See also

2007 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
Problem 11
Followed by
Problem 13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 10 Problems and Solutions