Ask your own question, for FREE!
Mathematics 12 Online
OpenStudy (alprincenofl):

The recurrence definition with initial condition of a function f(x)=5n+2,n=1,2,3… is

OpenStudy (alprincenofl):

Choices: http://prntscr.com/57stc3

jimthompson5910 (jim_thompson5910):

What are f(1), f(2), f(3)?

OpenStudy (anonymous):

I find this question to be problematic, because \(x\) is not in the function but \(n\) is.

OpenStudy (anonymous):

If it is a constant function, then there would only be one output, and so no recurrence.

jimthompson5910 (jim_thompson5910):

Good point. Maybe they meant to say f(n) = 5n+2

OpenStudy (alprincenofl):

So what is the answer? I think it's d) f(n)=f(n-1)+5,f(1)=7

jimthompson5910 (jim_thompson5910):

very good, start with 7 and add 5 to get the next term keep adding 5 to get the next terms, etc

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!