Question 1131981: A sequence has its first term equal to 4, and each term of the sequence is obtained by adding 2 to the previous term. If f(n) represents the nth term of the sequence, which of the following recursive functions best defines this sequence?
f(1) = 2 and f(n) = f(n − 1) + 4; n > 1
f(1) = 4 and f(n) = f(n − 1) + 2n; n > 1
f(1) = 2 and f(n) = f(n − 1) + 4n; n > 1
f(1) = 4 and f(n) = f(n − 1) + 2; n > 1
Answer by ikleyn(52787)   (Show Source):
You can put this solution on YOUR website! .
The last string.
To get the correct answer, you need simply READ the problem.
Also, you would benefited, if you understand each word that you read.
It is ENOUGH to solve it and to answer correctly.
I think that you will learn NOTHING (well, not much, to be polite) solving such problems.
It is the same as if the teacher will draw one red square and one black square and will ask you which is black.
This exercise is to check if you can read and understand the meaning of what you read.
|
|
|
