If we factorize the expression
We will get
Hope I helped!
Answer:
A)
Step-by-step explanation:
I used an Algebra app :) it is correct.
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 .
Represent the total number of boxes that both jean and clint stack in h hours,
total number of boxes=(50xh)+(60xh)
you want the total number of boxes for both of them together. so the amount they can stack times h or the hours. so if h=5 you would do 50x5 plus+ 60x5 which would give you 250 and 300. add the two you get 550 boxes for 5 hours total.
Answer:
they are all multiples of 5
Step-by-step explanation:
when you count by five you will meet each number =D
