a) Rowoon is trying to guess the COmbination to his combination lock. The "COmbination" is a sequence of three numbers, where the numbers range from I to 12, with no nUmbers repeated. How Many different "coMbinations" are possible if he knows that the last number in the COmbination is either I or I 1? (Hint: Use the fundamental counting principle)

College Algebra
1st Edition
ISBN:9781938168383
Author:Jay Abramson
Publisher:Jay Abramson
Chapter9: Sequences, Probability And Counting Theory
Section9.5: Counting Principles
Problem 36SE: The number of 5-element subsets from a set containing n elements is equal to the number of 6-element...
icon
Related questions
Question
100%

(see photo attached)

a) Rowoon is trying to guess the
COmbination to his combination lock. The
"COmbination" is a sequence of three
nUmbers, where the numbers range from I
to 12, with no numbers repeated. How Many
different "cOmbinations" are possible if he
knows that the last number in the
COmbination is either I or lT? (Hint: Use the
fundamental counting principle)
Transcribed Image Text:a) Rowoon is trying to guess the COmbination to his combination lock. The "COmbination" is a sequence of three nUmbers, where the numbers range from I to 12, with no numbers repeated. How Many different "cOmbinations" are possible if he knows that the last number in the COmbination is either I or lT? (Hint: Use the fundamental counting principle)
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning