Scribd Logo
Upload

Welcome to Scribd!

  • 52 views

    HL Induction Notes

    Uploaded by

    Joseph Ang
    This document discusses three methods of mathematical proof: direct proof, proof by contradiction, and proof by induction. It provides examples of each type of proof. Direct proof involves working directly from established facts to prove a statement. Proof by contradiction assumes the opposite of what is being proved to derive a contradiction. Proof by induction proves that if a statement is true for n=k, it is also true for n=k+1, and therefore true for all integers n. The document provides two examples of proofs by induction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    HL Induction Notes

    Uploaded by

    Joseph Ang
    52 views3 pages
    This document discusses three methods of mathematical proof: direct proof, proof by contradiction, and proof by induction. It provides examples of each type of proof. Direct proof involves working directly from established facts to prove a statement. Proof by contradiction assumes the opposite of what is being proved to derive a contradiction. Proof by induction proves that if a statement is true for n=k, it is also true for n=k+1, and therefore true for all integers n. The document provides two examples of proofs by induction.

    Original Description:

    dasdasdsa

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses three methods of mathematical proof: direct proof, proof by contradiction, and proof by induction. It provides examples of each type of proof. Direct proof involves working directly from established facts to prove a statement. Proof by contradiction assumes the opposite of what is being proved to derive a contradiction. Proof by induction proves that if a statement is true for n=k, it is also true for n=k+1, and therefore true for all integers n. The document provides two examples of proofs by induction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    52 views3 pages

    HL Induction Notes

    Uploaded by

    Joseph Ang
    This document discusses three methods of mathematical proof: direct proof, proof by contradiction, and proof by induction. It provides examples of each type of proof. Direct proof involves working directly from established facts to prove a statement. Proof by contradiction assumes the opposite of what is being proved to derive a contradiction. Proof by induction proves that if a statement is true for n=k, it is also true for n=k+1, and therefore true for all integers n. The document provides two examples of proofs by induction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    HL Mathematical Induction Notes 1

    HL Proof by Induction Notes


    1 Mathematics and Proving
    In mathematics there are three distinct ways that results can be proved.

    • Direct Proof

    • Proof by Contradiction

    • Proof by Induction

    1.1 Direct Proof


    In mathematics and logic, a direct proof is a way of showing the truth or falsehood of a
    given statement by a straightforward combination of established facts, usually existing
    lemmas and theorems, without making any further assumptions. You start with one side of
    an identity and work your way to the other side.

    We used this type of proof to prove, for example, the Sine rule and the quadratic formula.

    1.2 Proof by Contradiction


    One of the first proofs by contradiction is the following
    gem attributed to Euclid (325 BC - 265 BC).

    Theorem: There are infinitely many prime numbers.

    Proof: Assume to the contrary that there are only


    finitely many prime numbers, and all of
    them are listed as follows: p1 , p2 , ... , pn .

    Consider the number q = p1 p2 ... pn + 1.


    The number q is either prime or composite.

    If we divided any of the listed primes pi


    into q, there would result a remainder of 1
    for each i = 1, 2, ..., n. Thus, q cannot be
    composite.

    We conclude that q is a prime number, not among the primes listed above,
    contradicting our assumption that all primes are in the list p1 , p2 , ... , pn .

    Therefore, by proof of contradiction, there are infinitely many prime numbers.

    BL / CdK - HS OFS - August 2012


    HL Mathematical Induction Notes 2

    1.2 Proof by Induction


    There are three steps in an induction proof:

    1. Prove that the formula/proposition is true for n = 1 and therefore assume it is true for n = k .
    2. Prove that the formula/proposition is also true for n = k + 1.
    3. Use the induction to show that it is true for all n .

    It may be helpful to think of the domino effect.

    That is, given a long row of dominoes standing on end,


    one can be sure that if the first domino is pushed backwards:

    1. The first domino will fall.


    2. Whenever a domino falls, its next neighbor will also fall.
    3. Therefore, it is concluded that all of the dominoes will fall, and that this fact is inevitable.

    Example 1: Use mathematical induction to prove that


    1
    12 + 22 + 32 + ... + n2 = n(n+1)(2 n+1) for all positve integers.
    6

    Let P (n) be the proposition 12 + 22 + 3 2 + ... + n2 = 1 n (n+1)( 2n+1) where n∈ℤ+


    6

    2 1
    For P (1), 1 = 1 = (1)(1+1)( 2( 1)+1) ∴ True for n = 1
    6
    2 2 2 2 1
    For P (k ), 1 + 2 + 3 + ... + k = k ( k+1)( 2k +1) Assume true for n = k
    6
    2 2 2 2 2 1 2 Add (k +1)2 to both
    For P (k +1), 1 + 2 + 3 + ... + k + (k +1) = k ( k+1)( 2k +1) + ( k+1) sides
    6
    1 2
    = ( k (k +1)(2 k+1) + 6 (k +1) )
    6
    1
    = ( k+1)( k (2 k+1) + 6 (k +1)) Factorise out (k + 1) term
    6
    1 2
    = ( k+1)( 2k +k +6k +6)
    6
    1 2
    = ( k+1)( 2k +7 k+6) Factorise the quadratic
    6
    1
    = ( k+1)( k+2)(2 k+3)
    6
    1
    = ( k+1)((k +1)+1)( 2( k+1)+1) ∴ True for n = k + 1
    6

    +
    Therefore, using induction, the proposition is true for P(1) and P(k) ⇒ True for P(k + 1), so P(n) is true for all n∈ℤ
    .

    BL / CdK - HS OFS - August 2012


    HL Mathematical Induction Notes 3

    Example 2: Use mathematical induction to prove that the expression 5n + 9 n + 2 is always


    divisible by 4.

    n n
    Let f (n) = 5 + 9 + 2

    When n = 1, we have f (1) = 51+91+2


    = 16 Which is divisible by 4

    = 4× 4 ∴ True for n = 1

    When n = k, we have f (k ) = 5k +9k +2


    Assume true for n = k where f(n) = 4
    = 4× A times something.

    When n = k + 1, we have f (k +1) = 5 k+1+9k +1+ 2

    [NOTE: For proof of divisibility, we start by subtracting the two terms]

    f (k +1) − f ( k) = 5k+1+9k +1+ 2 − (5k +9k +2) Substitute

    = 5k+1+9k +1 − 5k − 9k Cancel the 2's


    k+1 k k+1 k
    = 5 − 5 + 9 − 9 Rearrange

    = 5k (5 − 1) + 9k (9 − 1) Factorise

    = 5k × 4 + 9 k ×8
    f (k +1) − 4×A = 5 k × 4 + 9 k ×8 Substitute f ( k )=4× A

    f (k +1) = 5k × 4 + 9 k ×8 + 4×A
    f (k +1) = 4(5k + 9k ×2 + A)

    This shows that f (k +1) is divisible by 4.

    Using proof by induction, since it is true for f (1) and f (k ) ⇒ True for f (k +1) ,
    +
    f (n) is divisible by 4 for all n∈ℤ .

    BL / CdK - HS OFS - August 2012

    You might also like