Respuesta :
Answer:
100
Step-by-step explanation:
the first digit can only be 1 thing: the letter c.
The second and third digits can make up number anywhere from 00 to 99. there are about 100 variations of the second and third digits, and 10 possibilities individually. multiply the 1 from the first digit and the 10 from the second and the 10 from the third to get 100.
Using the Fundamental Counting Theorem, it is found that she can choose 100 different passwords.
Fundamental counting theorem:
States that if there are n things, each with [tex]n_1, n_2, …, n_n[/tex] ways to be done, each thing independent of the other, the number of ways they can be done is:
[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]
In this problem:
- The first character is the letter 'c', hence [tex]n_1 = 1[/tex].
- For the second and for the third character, there are 10 options, as there are 10 digits from 0 to 9, hence [tex]n_2 = n_3 = 10[/tex]
Then:
[tex]N = n_1 \times n_2 \times n_3 = 1 \times 10 \times 10 = 100[/tex]
She can choose 100 different passwords.
A similar problem is given at https://brainly.com/question/24314866