Concrete Mathematics - Reccurent Problems - Warmups - (7)

Chapter One: Reccurrent Problems

Warmup

7. Let H(n) = J(n+1) - J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) - J(2n+1) = (2J(n+1)-1) - (2J(n)+1) = 2H(n) - 2, for all n >=1. Therefore it seems possible to prove that H(n) = 2 for all n, by induction on n. What's wrong here?

Well, in the book, equation (1.8) is as follows:

J(1) = 1;

J(2n) = 2J(n) - 1, for n >= 1;

J(2n+1) = 2J(n) + 1, for n >= 1.

Actually, we have H(1) = 0.