Yes, polygons are always plane figures
A recursive sequence is a sequence of numbers whose values are determined by the numbers that come before them in the sequence.
We’re given a sequence whose (n + 1)-th term f(n + 1) depends on the value of the n-th term f(n), specified by the recursive rule
f(n + 1) = -4 f(n) + 3
We’re also given the 1st term in the sequence, f(1) = 1. Using this value and the recursive rule, we can find the next term f(2). (Just replace n with 1.)
f(1 + 1) = -4 f(1) + 3
f(2) = -4 • 1 + 3
f(2) = -1
We do the same thing to find the next term f(3) :
f(2 + 1) = -4 f(2) + 3
f(3) = -4 • (-1) + 3
f(3) = 7
One more time to find the next term f(4) :
f(3 + 1) = -4 f(3) + 3
f(4) = -4 • 7 + 3
f(4) = -25
Answer:
There will be 90 ways to reach Greenup from Charleston.
Step-by-step explanation:
<em>Option C: 90 is correct.</em>
Let's name all the ways and try to visualize the roads.
C = Charleston
M = Mattoon
T = Toledo
G = Greenup
Task = Charleston to Greenup. How many different ways to reach?
1 1
2 2 1
C 3 M 3 T 2 G
4 4 3
5 5
6
So, Refer to this above diagram.
If we Start from C then go to 1 and then go to M and then go to 1 and then go to T and then go to 1 and then go G.
If you notice, in this single possibility we have 3 ways: C to 1 to M, M to 1 to T, T to 1 to G.
It means we will have: 5 x 6 x 3 = 90 number of ways to reach greenup from Charleston.
The slopes of two parallel lines must be identical.
We have slope
, so the slope for the parallel line be the same.
Now, to find an equation that also passes through the given point, we use slope-point form,
, where our point
is substituted for
.
Now, we convert to slope-intercept form as such.
And we are done. :) We can verify graphically that these are indeed parallel lines. See attached.
