Abby is registering at a Web site and must select a six-character password. The password can contain either letters or digits. a. How many passwords are possible if characters can be repeated? if no characters can be repeated?
b. How many passwords are possible if all characters are letters that can be repeated? if the password must contain exactly one digit? Which type of password is more secure? explain

a. 2176782336 with repeated characters. 1402410240 with no repeated characters.

b. 7964171460 when all letters can be repeated, but not numbers. 118813760 when only one number and letters can be repeated.

I believe that the password with all letters able to repeat and numbers not being able to is the most secure password, because if someone were to guess the password there is a 1/7964171460 chance of guessing the password.

Step-by-step explanation:

A. Since there are 26 different letters and 10 different numbers, there are 36 characters we can type. If characters can be repeated then, there is 2176782336 different passwords, since on all six number there are 36 possibilities each. So, 36 x 36 x 36 x 36 x 36 x 36 or 36^6 is to evaluated to find the answer. If characters are not to be repeated, there are 1402410240 different passwords, since on the first number there are 36, second has 35, third has 34, fourth has 33, fifth has 32, and sixth has 31. So, 36 x 35 x 34 x 33 x 32 x 31 is to be evaluated to solve this.

B. Since all characters that are letters can be repeated, then there are 26 letters to use forever and 10 numbers you can use with a limit. So, 36 x 35 x 34 x 33 x 32 x 31 which is to be solved if only numbers were to be used, which is 1402410240. Then, you add that with 36 x 35^5 and 36 x 35 x 34^4 and 36 x 35 x 34 x 33^3 and 36 x 35 x 34 x 33 x 32^2. which will be 7964171460. If the password must contain one digit, then you must multiply 10 with 26^5. Since, there is 10 different digits to use for the first number and 26 letters to choose from for the other five. So, it will be 26^5 times 10 which is 118813760.

b

step-by-step explanation:

answer: it's a

step-by-step explanation: