Ask your own question, for FREE!
Discrete Math 19 Online
OpenStudy (anonymous):

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

OpenStudy (anonymous):

what is f_n

OpenStudy (shubhamsrg):

you're welcome. :)

OpenStudy (sirm3d):

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

OpenStudy (anonymous):

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

OpenStudy (anonymous):

lol but how is f_n defined?

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!