Your company requires user passwords that can be made up of combinations of 21 (no caps) letters and 10 numerals only, in any order. each valid password must be a string of these no more than 18 in length, but atleast 14 in length.
(a) how many different passwords are there?
(b) suppose now that each password must contain at least 15 numerals. now how many possible passwords are there now?

a)There are possible different passwords.

b)There are possible different passwords.

Step-by-step explanation:

a) Each character of the string could be any of the 10 numerals or 21 letters, that means, each character may be any of these 31 different options.

If the password had only one character, there would be 31 different possible passwords, if it were a two characters string, there would be , because in the first place we can place any of the 31 characters, and then in the second place, we can do the same, we are asked of combinations without taking into account order of the characters.

A generalized form, to know how many different passwords we can make of n characters is .

If we have more than one possible lengths, we add those cases, in our case, we have 14 thru 18 characters, all that could be filled by any of the 31 possible characters.

.

b) If each password must contain at least 15 numerals, that means the minimum length of a password is 15 now.

We proceed the same as the a) point, but taking into account that for 15 characters, there is not 31 possible characters anymore, but 10.

Doing each individual length:

That is because we would multiply 10 possible options by the next possible 10 options and so on 15 times.

Now, for the sixteenth character, we multiply by the now 31 possible options.

For lengths 17 and 18, we do similar stuff, multiplying by 31 for each new character.

To know all the possible combinations, we add the combinations for each length:

We can see there is approximately 7 orders of magnitude less with the restriction than there is without it.

three-fourths of an hour

36÷48=0.75

0.75=

step-by-step explanation:

12475909