Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
← 55 members online
 0 viewing
John.Ellsworth
Group Title
Prove that f_1+f_3+⋯+f_(2n1)=f_2n when n is a positive integer. Must show inductive step. Thanks.
 one year ago
 one year ago
John.Ellsworth Group Title
Prove that f_1+f_3+⋯+f_(2n1)=f_2n when n is a positive integer. Must show inductive step. Thanks.
 one year ago
 one year ago

This Question is Open

sauravshakya Group TitleBest ResponseYou've already chosen the best response.0
what is f_n
 one year ago

shubhamsrg Group TitleBest ResponseYou've already chosen the best response.0
you're welcome. :)
 one year ago

sirm3d Group TitleBest ResponseYou've already chosen the best response.0
hmm, \(F_n\) is the fibonacci sequence, with \(F_1 = F_2\)
 one year ago

John.Ellsworth Group TitleBest ResponseYou've already chosen the best response.0
"what is f_n" Guess it didn't translate well when I copied over. The _ indicates a subscript.
 one year ago

Stiwan Group TitleBest ResponseYou've already chosen the best response.0
lol but how is f_n defined?
 one year ago
See more questions >>>
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.