Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

John.Ellsworth

  • 3 years 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
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    what is f_n

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

    you're welcome. :)

  3. sirm3d
    • 3 years 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
    • 3 years 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
    • 3 years 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

Sign Up
Find more explanations on OpenStudy
Privacy Policy