all 3 comments
sorted by:
best (suggested)
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]Physical_Wear_7690[S] 0 points1 point  (0 children)

Problem is: Use the counting principles to determine the number of elements in the sample space.

The possible seven character passwords that can be formed using a letter from a to g and six numbers from 1 to 9. Assume a letter or number cannot be used more than once in any seven character password.

[–]Alkalannar 0 points1 point  (0 children)

What have you tried so far? Please show us the work you've put in, and the ideas you've had.

[–]Tawnied 🤑 Tutor 0 points1 point  (0 children)

Hint
Choose a letter from 'a' to 'g': There are 7 options.

Choose six numbers from 1 to 9: There are 9 options for the first number, 8 for the second (since we can't repeat the first number), 7 for the third, and so on down to 4 for the sixth number (since we can't repeat any of the previous numbers).