The minimum number of degrees that a regular hexagon can be rotated before it carries onto itself is 60 degrees (D).
Answer:
i think the answer is 50
Step-by-step explanation:
The next step is to solve the recurrence, but let's back up a bit. You should have found that the ODE in terms of the power series expansion for


which indeed gives the recurrence you found,

but in order to get anywhere with this, you need at least three initial conditions. The constant term tells you that

, and substituting this into the recurrence, you find that

for all

.
Next, the linear term tells you that

, or

.
Now, if

is the first term in the sequence, then by the recurrence you have



and so on, such that

for all

.
Finally, the quadratic term gives

, or

. Then by the recurrence,




and so on, such that

for all

.
Now, the solution was proposed to be

so the general solution would be


Answer: A
Step-by-step explanation: Domain is the input, or x values. You can see the points (1, 6), (2,3), (3,1), and (6,5). In ordered pairs, the x values are the numbers on the left:
(x, y)
So if we take all the numbers on the left, we get 1, 2, 3, and 6. Thus, our domain is {1,2,3,6}