EXTRA POINTS!!! Write a system of three inequalities that has (2, 1) in the solution set.
1 answer:
You might be interested in
Answer:
26*26*26 = 17576 ways to select 3 letters
10*10= 100 ways to select 2 numbers
So then the total number of ways are:
possible ways
Step-by-step explanation:
For this case we assume that we have 26 letters from A to Z and 10 numbers from 0 to 9 .
And we want to calculate the number of possible passwords possible if the password consists of 3 letters followed by 2 digits.
And for this case we can use the multiplication principle of combinatories, since we don't have any restriction about the letters of the numbers we can have repetition of letters or numbers.
For the number of possible letters:
26*26*26 = 17576 ways to select 3 letters
10*10= 100 ways to select 2 numbers
So then the total number of ways are:
possible ways