How to write proofs by induction about divisibility – video clip


Want to prove that m | f(k+1) if m | f(k)? Then start from

m | f(k)

and fiddle with the right-hand side of that divisibility statement, which you can do either by adding (or subtracting) multiples of m, or multiplying f(k) by any number, until you get

m | f(k+1)