A community for students.
Here's the question you clicked on:
← 55 members online
 0 viewing
anonymous
 one year ago
A sequence is defined by the recursive function f(n + 1) = f(n). If f(3) = 9 , what is f(1) ?
anonymous
 one year ago
A sequence is defined by the recursive function f(n + 1) = f(n). If f(3) = 9 , what is f(1) ?

This Question is Closed

jango_IN_DTOWN
 one year ago
Best ResponseYou've already chosen the best response.1sure this is the question?? I dont see any recursion here... @destiny5

jango_IN_DTOWN
 one year ago
Best ResponseYou've already chosen the best response.1and if the question is correct then 9=f(3)=f(2)=f(1) and hence f(1)=9

freckles
 one year ago
Best ResponseYou've already chosen the best response.0f(n+1)=f(n) <is this right? f(n+1)=f(n) means term equals previous term which means all terms are equal
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.