Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

John.Ellsworth

  • one year ago

Prove that f_1+f_3+⋯+f_(2n-1)=f_2n when n is a positive integer. Must show inductive step. Thanks.

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

    what is f_n

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

    you're welcome. :)

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

    hmm, \(F_n\) is the fibonacci sequence, with \(F_1 = F_2\)

  4. John.Ellsworth
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    "what is f_n" Guess it didn't translate well when I copied over. The _ indicates a subscript.

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

    lol but how is f_n defined?

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

    • Attachments:

Ask your own question

Ask a Question
Find 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
  • 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.