A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • one year ago

Prove that walk(n) = fn+1 for all n greater than or equal to 1

  • This Question is Closed
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    better formatting \[walk(n) = f _{n+1}\]

  2. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i know its an induction proof but the part im at is trying to show that walk(k+1) = [f _{k+2}\] and im assuming ive done everything correctly i just can think of how to manipulate the left hand side and make it look like the right hand side

  3. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    \[walk(k+1) = f _{k+2}\] not sure what happened above but this is what im pretty sure im trying to prove

  4. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.