180, is the answer because when I had a question like that you have to add
7×10^7 = 70000000 (10^7 = 10000000)
If you would like to solve the equation b^2 + 9 * b + 18 = 0 for the variable b, you can do this using the following step:
b^2 + 9 * b + 18 = 0
(b + 3) * (b + 6) = 0
Result:
1. solution: b = - 3
2. solution: b = - 6
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
Answer:
12 and 28
Step-by-step explanation:
Represent the numbers using x and y. Then y - x = 16. (y is the larger one.)
Then 3y = 7x, and y = (7/3)x.
Substituting (7/3)x for y in y - x = 16, we get:
(7/3)x - x = 16.
Eliminate the fraction by multiplying all three terms by 3:
7x - 3x = 48, or 4x = 48, yielding x = 12. Then y = (7/3)(12) = 28.