Lesson 4: Proving divisibility by induction

Prove n3+2nn^3 + 2n is divisible by 33

SkillProving divisibility by induction

Worked example

  • Complex familiar
  • Technology free

Prove by mathematical induction that n3+2nn^3 + 2n is divisible by 33 for all n∈Z+n \in \mathbb{Z}^+.

1 of 6 steps
  1. Step 1: Initial statement

    Let P(n)P(n) be the statement "n3+2nn^3 + 2n is divisible by 33", n∈Z+n \in \mathbb{Z}^+. When n=1n = 1: 13+2(1)=3=3×11^3 + 2(1) = 3 = 3 \times 1. So P(1)P(1) is true.

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Method

  1. Expand the expression for k+1k + 1.

  2. Group the terms that make up the expression for kk, and replace them by mMmM.

  3. Factor out mm from what is left and say why the bracket is an integer.

Watch out for

  • Expanding (k+1)3(k + 1)^3 as k3+1k^3 + 1. It is k3+3k2+3k+1k^3 + 3k^2 + 3k + 1.

  • Not grouping k3+2kk^3 + 2k together, so the assumption never gets used.

Save your progress with a free account