Determine whether the number is a solution of the given inequality.
1 answer:
You might be interested in
Answer:
35
Step-by-step explanation:
Answer:
Step-by-step explanation:
GIVEN: two two-letter passwords can be formed from the letters A, B, C, D, E, F, G and H.
TO FIND: How many different two two-letter passwords can be formed if no repetition of letters is allowed.
SOLUTION:
Total number of different letters
for two two-letter passwords different are required.
Number of ways of selecting different letters from
letters
Hence there are different two-letter passwords can be formed using
letters.