 Home

Codex Wiki

List of universities

University of Oxford

Course of the University of Oxford

Undergraduate course of the University of Oxford

Computer science course of the University of Oxford

Year 1 of the computer science course of the University of Oxford

Past exam of the year 1 of the computer science course of the University of Oxford

2015

Discrete mathematics, continuous mathematics, and probability

We prove <Cassini's identity> by <mathematical induction>. At $n=1$,
$$
F_0F_2-F_1^2=0\cdot1-1=-1=(-1)^1.
$$
Suppose $D_n=F_{n-1}F_{n+1}-F_n^2=(-1)^n$. The <Fibonacci recurrence> gives $F_{n-1}=F_{n+1}-F_n$ and hence
$$
\begin{aligned}
D_{n+1}
&=F_nF_{n+2}-F_{n+1}^2\\
&=F_n(F_{n+1}+F_n)-F_{n+1}^2\\
&=-\bigl((F_{n+1}-F_n)F_{n+1}-F_n^2\bigr)
=-D_n=(-1)^{n+1}.
\end{aligned}
$$
The induction proves
$$
\boxed{F_{n-1}F_{n+1}-F_n^2=(-1)^n\qquad(n\ge1).}
$$

Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 2 / d / Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 2 / d / Solution

 Ancestors (12)

 Discussion (0) New discussion

 Articles by others on the same topic (0)

Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability / 2 / d / Solution

 Ancestors (12)

 Discussion (0)  Subscribe (1) New discussion

 Articles by others on the same topic (0)

 Discussion (0) New discussion