The answer to question 5 is D.5 and the answer to question 9 is (-2,-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: OPTION C.
Step-by-step explanation:
It is important to know the following:
<u> Dilation:</u>
- Transformation in which the image has the same shape as the pre-image, but the size changes.
- Dilation preserves betweenness of points.
- Angle measures do not change.
<u>Translation:</u>
- Transformation in which the image is the same size and shape as the pre-image.
- Translation preserves betweenness of points.
- Angle measures do not change.
Therefore, since the Square T was translated and then dilated to create Square T'', we can conclude that the statement that explains why they are similar is:
<em>Translations and dilations preserve betweenness of points; therefore, the corresponding sides of squares T and T″ are proportional.</em>
Answer:
t=5/10n
Step-by-step explanation:
The question wants to know how much time it takes to run one lap, not how many laps can be run in a certain amount of time.
Answer:
R1 = {(1, 7) (2, 7) (4, 7) (6, 7)}
R3 = {(x, y) (y, z) (z, t) (t, v)}
R1 and R3 are functions because first element in the ordered pair is not repeating, i.e they have unique images
