Please help .!!!!!!!!!!!!!!!!!!!
1 answer:
You might be interested in
Answer:
38.46%
Step-by-step explanation:
There are no names or marking that can make the calculator look different, so the order is not important. Then we should use a combination to solve this problem.
There are 40 calculators in one shipment, 37 of them good items and 3 of them are defect items. We need to choose 19 good calculators and 1 defect calculator. The number of ways to do that will be:
*
= 37!
= 53017895700
The number of possible ways to choose 20 calculators out of 40 calculators will be:
=
=137846528820
The chance will be: 53017895700/ 137846528820 = 0.3846= 38.46%
Answer:
A)
B)
C) for n = 2
= 1
for n = 3
= 3
for n = 4
= 8
for n = 5
= 19
Step-by-step explanation:
A) A recurrence relation for the number of bit strings of length n that contain a pair of consecutive Os can be represented below
if a string (n ) ends with 00 for n-2 positions there are a pair of consecutive Os therefore there will be : strings
therefore for n ≥ 2
The recurrence relation for the number of bit strings of length 'n' that contains consecutive Os
b ) The initial conditions
The initial conditions are :
C) The number of bit strings of length seven containing two consecutive 0s
here we apply the re occurrence relation and the initial conditions
for n = 2
= 1
for n = 3
= 3
for n = 4
= 8
for n = 5
= 19