Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This question already has an answer here:

Prove that f0 – f1 + f2 - … - f2n-1 + f2n = f2n-1 – 1. For n is all positive numbers. I have an idea to what I must do, but I can't figure what the base case is. I think it is f(0) = 0 and f(1) = 1. But then idk how to prove these?

share|cite|improve this question

marked as duplicate by lab bhattacharjee, Claude Leibovici, Stefan Hansen, Sami Ben Romdhane, Michael Hoppe Mar 11 '14 at 8:34

This question was marked as an exact duplicate of an existing question.

up vote 0 down vote accepted

Using Induction,

let $\displaystyle A(n):F_0-F_1+F_2-\cdots-F_{2n-1}+F_{2n}=F_{2n-1}-1$ holds true for $n=m$

$\displaystyle\implies A(m):F_0-F_1+F_2-\cdots-F_{2m-1}+F_{2m}=F_{2m-1}-1$

$\displaystyle\implies A(m+1):F_0-F_1+F_2-\cdots-F_{2m-1}+F_{2m}-F_{2m+1}+F_{2(m+1)}$





Now establish the base case $n=1\implies A(1)$

share|cite|improve this answer

f(0) - f(1) + f(2) - f(3) + f(4) - f(5) + ..- - f(2n-1) + f(2n) = (f(2)+f(4)+..f(2n)) - (1 + f(3) + f(5) + .. + f(2n-1)) = (f(2n+1) - 1) - f(2n) = f(2n-1) - 1.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.