Matchmaticians
Home How it works Log in Sign up
Matchmaticians
  • Home
  • Search
  • How it works
  • Ask Question
  • Tags
  • Support
  • Affiliate Program
  • Log in
  • Sign up

Fibonacci sequence 

Prove that 
$$\sum_{i=0}^n (f_i)^2=f_nf_{n+1},$$
where $f_n$ is the Fibonacci sequence. 

Discrete Mathematics Sequences and Series Induction
Ava Smith Ava Smith
31
Report
  • Share on:
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
  • answered
  • 1081 views
  • $4.00

Related Questions

  • $Use induction to prove that for any natural n the following holds:  1\bullet2+2\bullet 3+...+(n-1)\bullet n=\frac{(n-1)n(n+1)}{3} $
  • Help Resolving Questions
  • Find the generating function
  • Sequences undergrad
  • Find sum of  $n$ term, sum to infinity,  least value for $n$
  • Set Theory Question Help
  • Discrete math- Range and preimage of the floor function
  • [Discrete Mathematics] Big-O Notation 
Home
Support
Ask
Log in
  • About
  • About Us
  • How it works
  • Review Process
  • matchmaticians
  • Privacy Policy
  • Terms of Use
  • Affiliate Program
  • Questions
  • Newest
  • Featured
  • Unanswered
  • Contact
  • Help & Support Request
  • Give Us Feedback

Get the Matchmaticians app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store Get Matchmaticians on Google Play
Copyright © 2019 - 2025 Matchmaticians LLC - All Rights Reserved

Search

Search Enter a search term to find results in questions