Proof Ideas - Strong Induction, Pascal's Triangle and Fibonacci Numbers

133 Views Asked by At

I'm looking for attributes/characteristics/properties to prove about Pascal's Triangle or the Fibonacci numbers. Preferably something that requires a strong induction proof that is on the same level as proving things such as the sum of the elements in the nth row of Pascal's triangle is $2^n$. Simple induction proof ideas are also fine.