Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2007 AMC 10A Problems/Problem 12"

(→‎Video Solution)
(→‎Solution 3 (More detailed))
 
(3 intermediate revisions by the same user not shown)
Line 15: Line 15:
 
Without loss of generality, let's call one of the tour guides tour guide A, and the other tour guide B. To count the number of total groupings of guides and tourists possible, we can count the number of ways some number of tourists go to tour guide A. Thus, we can see that the total number of groupings is:
 
Without loss of generality, let's call one of the tour guides tour guide A, and the other tour guide B. To count the number of total groupings of guides and tourists possible, we can count the number of ways some number of tourists go to tour guide A. Thus, we can see that the total number of groupings is:
 
<cmath> \binom{6}{1} + \binom{6}{2} + \binom{6}{3} + \binom{6}{4} + \binom{6}{5} = \boxed{62} \text{ (D)}</cmath>
 
<cmath> \binom{6}{1} + \binom{6}{2} + \binom{6}{3} + \binom{6}{4} + \binom{6}{5} = \boxed{62} \text{ (D)}</cmath>
 +
 +
== Solution 3 (More detailed) ==
 +
Very similar to the solution above, we begin by naming the tour guides [https://artofproblemsolving.com/wiki/index.php/Without_loss_of_generality / WLOG], tour guide <math> A </math> and tour guide <math> B </math>.
 +
The possible groupings of tourists and tour guides are:
 +
Tour guide <math> A </math> takes 1, Tour guide <math> B </math> takes 5, where there are <math> \binom{6}{1} </math> = <math> 6 </math> ways to arrange the tourists.
 +
Tour guide <math> A </math> takes 2, Tour guide <math> B </math> takes 4, where there are <math> \binom{6}{2} </math> = <math> 15 </math> ways to arrange the tourists.
 +
Tour guide <math> A </math> takes 3, Tour guide <math> B </math> takes 3, where there are <math> \binom{6}{3} </math> = <math> 20 </math> ways to arrange the tourists.
 +
Tour guide <math> A </math> takes 4, Tour guide <math> B </math> takes 2, where there are <math> \binom{6}{2} </math> = <math> 15 </math> ways to arrange the tourists.
 +
Tour guide <math> A </math> takes 5, Tour guide <math> B </math> takes 1, where there are <math> \binom{6}{1} </math> = <math> 6 </math> ways to arrange the tourists.
 +
 +
 +
Thus, the total number of different groupings of guides and tourists is equal to <math> 6 + 15 + 20 + 15 + 6 </math>, which equals <math> \boxed{\text{ (D)} 62} </math>
 +
 +
~Darth_Cadet
  
 
== See also ==
 
== See also ==

Latest revision as of 17:07, 14 March 2023

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$

Video Solution by OmegaLearn

https://youtu.be/0W3VmFp55cM?t=3352

~ pi_is_3.14

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 = \boxed{62}\ \mathrm{(D)}$.

Solution 2

Without loss of generality, let's call one of the tour guides tour guide A, and the other tour guide B. To count the number of total groupings of guides and tourists possible, we can count the number of ways some number of tourists go to tour guide A. Thus, we can see that the total number of groupings is: \[\binom{6}{1} + \binom{6}{2} + \binom{6}{3} + \binom{6}{4} + \binom{6}{5} = \boxed{62} \text{ (D)}\]

Solution 3 (More detailed)

Very similar to the solution above, we begin by naming the tour guides / WLOG, tour guide $A$ and tour guide $B$. The possible groupings of tourists and tour guides are: Tour guide $A$ takes 1, Tour guide $B$ takes 5, where there are $\binom{6}{1}$ = $6$ ways to arrange the tourists. Tour guide $A$ takes 2, Tour guide $B$ takes 4, where there are $\binom{6}{2}$ = $15$ ways to arrange the tourists. Tour guide $A$ takes 3, Tour guide $B$ takes 3, where there are $\binom{6}{3}$ = $20$ ways to arrange the tourists. Tour guide $A$ takes 4, Tour guide $B$ takes 2, where there are $\binom{6}{2}$ = $15$ ways to arrange the tourists. Tour guide $A$ takes 5, Tour guide $B$ takes 1, where there are $\binom{6}{1}$ = $6$ ways to arrange the tourists.


Thus, the total number of different groupings of guides and tourists is equal to $6 + 15 + 20 + 15 + 6$, which equals $\boxed{\text{ (D)} 62}$

~Darth_Cadet

See also

2007 AMC 10A (Problems • Answer Key • Resources)
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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_AMC_10A_Problems/Problem_12&oldid=190974"