Answer:
1. 1+2
2. 4-1
3. 3-2
4. 14+18
5. 10-6
6. 5-4
Step-by-step explanation:
1. GCF is 7
2. GCF is 11
3. GCF is 6
4. GCF is 5
5. GCF is 6
6. GCF is 20
Answer:
16
Step-by-step explanation:
50-2= 48
48 divide by 2 is 16
Answer:
B:
Step-by-step explanation:
1. Substitute
for c:
2. Solve substitution: 
3. Compare
to calculated answers when 
4.
when
is 
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
2.06 liters is your answer.