Write a recursive formula and an explicit formula for the following arithmetic sequence.
10,17,24,31,

Recursive Formula: f(1) = 10, f(n) = f(n − 1) + 7 for n ≥ 2.

Explicit Formula: f(n)= 10+7(n-)

Step-by-step explanation:

Recursive Formula:  f(1) = first term, f(n) = f(n − 1) + d for n ≥ 2.

Explicit Formula: f(n)= f(1)+d(n-1)

yes because there is exactly one y value for every x value

for function there can't be more than one value for every x value