Induction Divisibility Proof

I work through an Induction Proof for divisibility. We Prove by Induction that 9^n-1 gives a multiple of 8 for all n which are positive integers.
More Induction Proofs here:

Introduction to Induction Proofs, Partial Sums of Sequences

[HanTheNah]

This was a great video! The explanations were on point - induction proofs are a vibe

[georgesadler]

Professor RobBob, once again this is an outstanding video/lecture on Induction Divisibility Proof/ Proof by Induction. The more times each student sees a proof by induction, the better and this will help to improve their proof writing skills.

[sharifahmed]

Thanks prof, I am very impressed the organisation on the two chalk boards, the content and a beautiful delivery. I believe your students are very privileged bunch to have a such a great educator.

[XTC]

This particular proof can be done much quicker without induction. It's still a nice example to illustrate induction.

[kvnagendra]

*urs moustache is super osm, I like it and I want to grow like u*