I'm trying to figure out how many possible passwords can be created from these three questions. Repetition is allowed.
- $8$ characters long, at least $1$ capital, at least $1$ number
- $8$ characters long, at least $1$ capital
- $8$ characters, at least $1$ capital, $1$ lowercase, $1$ number, $1$ special character ($3$ total special characters)
My rough work - I'm unsure how to do this, the at "least portion" of the question confuses me....
$nCr(52,1)^6 \cdot nCr(10,1) \cdot nCr(26,1)$
$nCr(52,8)$
$nCr(26,1) \cdot nCr(26,1) \cdot nCr(10,1) \cdot nCr(3,1) \cdot nCr(52,1,)^4$
$52 =$ Capitals and lowercases, $10 =$ Numbers from $0-9$, $3 =$ Special Characters
The complement of "at least 1" is "none".
Use the principle of inclusion and exclusion.
$$\mu(\text{Any 8 Chars})-\mu(\text{No Caps})-\mu(\text{No Digits})+\mu(\text{Neither Caps nor Digits})$$
Note that $\mu(\text{Any 8 Chars})=(26+26+10+3)^8$ when there are 26 capitals, 26 lowercase, 10 digits, and 3 special characters, and repetitions are allowed.
Solve the others similarly.