Use the counting principle to determine the total number of possible outcomes. 1) A student takes a 3 question multiple-choice quiz. There are four options (A,B,C,D) for each question. In how many ways can the student answer the 3 questions? 2) A school district assigns each of their students a password that consists of three unique letters (no repetition), followed by three unique numbers (no repetition), and finally one symbol (@, !, #, $, %, or &) at the end. How many passwords are possible?

Use the counting principle to determine the total number of possible outcomes. 1) A student takes a 3 question multiple-choice quiz. There are four options (A,B,C,D) for each question. In how many ways can the student answer the 3 questions? 2) A school district assigns each of their students a password that consists of three unique letters (no repetition), followed by three unique numbers (no repetition), and finally one symbol (@, !, #, $, %, or &) at the end. How many passwords are possible?

Holt Mcdougal Larson Pre-algebra: Student Edition 2012

1st Edition

ISBN:9780547587776

Author:HOLT MCDOUGAL

Publisher:HOLT MCDOUGAL

Chapter11: Data Analysis And Probability

Section11.7: Combinations

Problem 24E

See similar textbooks