HSC Mathematics Advanced, Extension 1, and Extension 2/3-Unit/HSC/Induction

From testwiki
Jump to navigation Jump to search

Induction is a form of proof useful for proving equations involving non-closed expressions (i.e., expressions with n terms; sequences).

Explanation

Induction involves first proving that the equation is true for n=1, then proving true for n=k+1 (assuming for the purpose of the proof that the equation holds true for n=k). Since it is true for n=k and true for n=k+1, and also true for n=1, it is true for n=2. It follows that it is true for all positive integers n.

Examples

Proving the formula for the sum of a series

Q: Prove by mathematical induction that for all integers n1,

13+23+33+43++n3=(1+2+3+....n)2

A:

  1. When n=1, 13=1=14(1)2((1)+1)2=14(4)=1, so it is true for n=1
  2. Suppose that the statement is true for k,k. That is, suppose that 13+23+33+43++k3=14k2(k+1)2. This is sometimes called the induction hypothesis.
  3. Then prove the statement for n=k+1 (that is, prove that 13+23+33++(k+1)3=14(k+1)2(k+2)2:
    LHS=13+23+33+4+3++k3+(k+1)3=14k2(k+1)2+(k+1)3 (by the induction hypothesis)=14(k+1)2(k2+4(k+1))=14(k+1)2(k2+4k+4)=14(k+1)2(k+2)2=RHS
  4. It follows from parts 1 and 2 by mathematical induction that the statement is true for all positive integers n.

Template:BookCat