find the third,fifth and seventeenth terms of the sequence described by each explicit formula f(n)=8+3(n-1) and how you got it
1 answer:
You might be interested in
Answer: The number of different passwords can be formed = 1,000,000
Step-by-step explanation:
In general total digits = 10 [ from 0 to 9]
If a password contains 6 digits, then by fundamental principal of counting, the total number of different passwords =
Hence, the number of different passwords can be formed = 1,000,000