Thread: Trees

Prove the following by induction on n

1+5+9+....+(4n-3) = n(2n-1) for all n => 1

Originally Posted by Tom101

Prove the following by induction on n

1+5+9+....+(4n-3) = n(2n-1) for all n => 1

check base case n=1

1=1(2(1)-1) true

assume n=k



Show k+1


by the induction hypothsis




The last one is k+1

QED