Back

Solution: 2014 Fall Final - 2

Author: Michiel Smid

Question

A password consists of 13 characters, each character being one of the ten digits $0,1,2,\dots,9$.
A password must contain at least one odd digit and at most two even digits. How many passwords are there?
(a)
$5^{13} + 13 \cdot 9^{12} + {13 \choose 2}9^{12}$
(b)
$5^{13} + 13 \cdot 5^{13} + {13 \choose 2}5^{13}$
(c)
$5^{12} + 13 \cdot 5^{12} + {13 \choose 2}5^{12}$
(d)
$5 \cdot 9^{12} + 13 \cdot 5 \cdot 9^{12} + {13 \choose 2}5 \cdot 9^{12}$

Solution

  • A = Event that the password contains 0 event digits
    Since every digit is odd, each of the 13 digits must be chosen from the set {1,3,5,7,9}
    $ |A| = 5^{13} $
  • B = Event that the password contains 1 event digit
    Since 1 of the digits is even, there are 13 positions to place the single even digit: $ \binom{13}{1} $
    Since the 1 even digit can be chosen from the set {0,2,4,6,8}, there are 5 choices for the even digit: $ 5 $
    The remaining 12 digits must be chosen from the set {1,3,5,7,9}, so there are $ 5^{12} $ ways to choose the remaining digits
    $ |B| = \binom{13}{1} \cdot 5 \cdot 5^{12} $
  • C = Event that the password contains 2 event digits
    Since 2 of the digits are even, there are $ \binom{13}{2} $ ways to choose the 2 positions for the even digits
    Since the 2 even digits can be chosen from the set {0,2,4,6,8}, each digit has 5 choices: $ 5^2 $
    The remaining 11 digits must be chosen from the set {1,3,5,7,9}, so there are $ 5^{11} $ ways to choose the remaining digits
    $ |C| = \binom{13}{2} \cdot 5^2 \cdot 5^{11} $

$ |A| + |B| + |C| = 5^{13} + \binom{13}{1} \cdot 5 \cdot 5^{12} + \binom{13}{2} \cdot 5^2 \cdot 5^{11} $

$ |A| + |B| + |C| = 5^{13} + 13 \cdot 5^{13} + \binom{13}{2} \cdot 5^{13} $