A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
Prove Cassini's identity using the matrix representation of the Fibonacci sequence
anonymous
 4 years ago
Prove Cassini's identity using the matrix representation of the Fibonacci sequence

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0oh is that all? easy! one question, whats cassini's identity? To google!

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Heh, I can open questions all over the shop now.....:)

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0http://planetmath.org/ProofofCassinisIdentity.html come across this which answeres your question, but certainly doesnt answer mine.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0out of interest. whats the formula for the fibonacci sequence

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0\[F_n = F_{n2} + F_{n1}\] ?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0oh sorry yes your right there is none there

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0You can represent the Fibonacci sequence as: \[\left[\begin{matrix}F_{n+1} & F_n \\ F_n &F_{n1}\end{matrix}\right] = \left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]^n\]

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0This is fairly easy to prove by induction

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0define F_0 as 0, F_1 as 1, and F_2 as 1

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0If the first equation is true, then\[\left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]^{n+1}=\left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]^n*\left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]\]: \[= \left[\begin{matrix}F_{n+1} & F_n \\ F_n & F_{n1}\end{matrix}\right]*\left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]\] \[= \left[\begin{matrix}F_{n+1}+F_n & F_{n+1} \\ F_n+F_{n1} & F_n\end{matrix}\right]=\left[\begin{matrix}F_{n+2} & F_{n+1} \\ F_{n+1} & F_n\end{matrix}\right]\]

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0So: \[\left[\begin{matrix}F_{n+1} & F_n \\ F_n & F_{n1}\end{matrix}\right] = \left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]^n \forall n \in Z_+\]

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0now, take the determinant of both sides: \[F_{n+1}F_{n1}F_n^2=\det \left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right]^n\]

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The determinant of the products of square matrices is the products of the determinants of the matrices: \[= (\det \left[\begin{matrix}1 & 1 \\ 1 & 0\end{matrix}\right])^n\]
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.