Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Alg 2 probability help

OpenStudy (anonymous):

Gwen, Joshua, Tamara, Miguel, and Khalil are running for student council offices. The strident with the greatest number of votes is elected president, and the student receiving the second greatest number of votes is elected Vice President. HOW DO I MAKE A TREE DIAGRAM FOR THE OUTCOMES?

jimthompson5910 (jim_thompson5910):

G = Gwen J = Joshua T = Tamara M = Miguel K = Khalil Start off with 5 branches |dw:1440641029161:dw|

jimthompson5910 (jim_thompson5910):

After picking 1 person, you have 5-1 = 4 people left to choose from so you'll have 4 branches attached to G |dw:1440641281859:dw|

jimthompson5910 (jim_thompson5910):

every letter but G will be used to form the next 4 branches |dw:1440641315068:dw|

jimthompson5910 (jim_thompson5910):

similarly, for J, you'll have 4 branches with G,T,M,K |dw:1440641357019:dw|

jimthompson5910 (jim_thompson5910):

and so on until the other letters get 4 branches of their own you'll have a total of 5*4 = 20 unique branches or paths

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!