Let us say that we are going to create eight letter passwords from a set of 23 letters (all of the alphabet except I, L and O) plus the 10 numerics and the five symbols #$&+- How many different ways could they be selected if we allow a symbol to be used as many times as possible? How many different ways could they be selected if we do not allow a symbol to be reused and order is important?

Let us say that we are going to create eight letter passwords from a set of 23 letters (all of the alphabet except I, L and O) plus the 10 numerics and the five symbols #$&+- How many different ways could they be selected if we allow a symbol to be used as many times as possible? How many different ways could they be selected if we do not allow a symbol to be reused and order is important?

College Algebra

10th Edition

ISBN:9781337282291

Author:Ron Larson

Publisher:Ron Larson

Chapter8: Sequences, Series,and Probability

Section8.6: Counting Principles

Problem 3ECP: A combination lock will open when you select the right choice of three numbers (from 1 to 30,...

See similar textbooks