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
Report
  • Share:
  • answered
  • 110 views
  • $4.00

Related Questions

  • using  maclaurin series for tan(x) and equation for length of cable to prove that x=
  • Logic quesiton A v ¬A
  • Show that $\sum_{n=1}^{\infty} \frac{\sin n}{n}$ is convergent
  • Markov Process Problem
  • proof by induction
  • Prove that $1+\frac{1}{\sqrt{2}}+\dots+\frac{1}{\sqrt{n}} \leq 2 \sqrt{n}-1$
  • Discrete Structures - Proving a statement true 
  • Recursive Set
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 - 2023 Matchmaticians LLC - All Rights Reserved

Search

Search Enter a search term to find results in questions