Answer:
250
Step-by-step explanation:
Answer:
Step-by-step explanation:
The problem relates to filling 8 vacant positions by either 0 or 1
each position can be filled by 2 ways so no of permutation
= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2
= 256
b )
Probability of opening of lock in first arbitrary attempt
= 1 / 256
c ) If first fails , there are remaining 255 permutations , so
probability of opening the lock in second arbitrary attempt
= 1 / 255 .
Answer:
Step-by-step explanation:
Answer:
a(n) = 13 - 2n
Step-by-step explanation:
The explicit formula variables are a(n) = a(1) + d (n - 1). The a(1) is your number you started out with, and the d is the common difference. From the recursive formula example, you see that your first number is 11 and your difference is -2.
1. Plug the numbers into the equation : a(n) = 11 - 2 (n - 1)
2. Distribute: a(n) = 11 - 2n + 2
3. Add like terms: a(n) = 13 - 2n
If you want to double check, you can plug 1 into n and see if you get 11. I did this, and I did so it should be correct. Hope this made sense! Have a great day :)
