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:
it's B
Step-by-step explanation:
the text gives you clues "times" is a form of multiplication. therefore it would be 8 TIMES 4
Answer:
she did nothing wrong lowkey
Step-by-step explanation:
Answer:
Step-by-step explanation:
We have:
<em> subtract 7a from both sides</em>
<em>add 3 to both sides</em>
