Ask your own question, for FREE!
Mathematics 17 Online
OpenStudy (anonymous):

How do I prove n summation i =1 F1 = Fn+2 -1 I know I'm supposed to use Mathematical Induction. So Step 1 is to see if its true for n=1 So I plug in 1 for n and I get F1 = f3 -1. How do I know if thats true? Do I choose random #'s?

OpenStudy (anonymous):

|dw:1379526211416:dw|

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!