Using the extended principal of mathematical induction, we have shown that B(n) = Fn
for all n ∈ N. We did this first by proving the hypothesis for n = 0 and n = 1, and then in
the inductive step, we included all n such that n > 1 by applying the recursive definition of
the Fibonacci sequence.