Divisibility and multiple test proofs

Proof that an expression is divisible by a certain integer (power type)

• Start by proving that it is true for n=1, then assume true for n=k and prove that it is true for n=k+1. If so it must be true for all positive integer values of n.

Proof that an expression is divisible by a certain integer (non-power type)