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
  • 760 views
  • $4.00

Related Questions

  • Discrete Math/ Set theory Question 
  • proof by induction
  • Arithmetic Sequences Help
  • Taylor series/ Mclaurin Series
  • Combinatorics Questions: Card Pairs, Letter Arrangements, and Number Sequences
  • Mathematical Model: Discrete Logistic Growth and Fish Harvesting
  • Taylor polynomial 
  •  How many balanced lists of n left and n right parentheses are there? 
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