Scribd Logo
Upload

Welcome to Scribd!

  • 46 views

    P P P P P: Mathematical Induction

    Uploaded by

    Taka
    The document introduces mathematical induction, which is a method of proof used to establish that a statement holds for all natural numbers. It involves two steps: 1) showing the statement is true for the base case, and 2) assuming the statement is true for some integer k and using this to prove it is true for k+1. Examples are provided to demonstrate proofs by mathematical induction for statements involving sums and sequences. Exercises at the end involve using induction to prove additional mathematical statements.

    Copyright:

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

    P P P P P: Mathematical Induction

    Uploaded by

    Taka
    46 views6 pages
    The document introduces mathematical induction, which is a method of proof used to establish that a statement holds for all natural numbers. It involves two steps: 1) showing the statement is true for the base case, and 2) assuming the statement is true for some integer k and using this to prove it is true for k+1. Examples are provided to demonstrate proofs by mathematical induction for statements involving sums and sequences. Exercises at the end involve using induction to prove additional mathematical statements.

    Original Description:

    mm,

    Original Title

    handout2induksi

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document introduces mathematical induction, which is a method of proof used to establish that a statement holds for all natural numbers. It involves two steps: 1) showing the statement is true for the base case, and 2) assuming the statement is true for some integer k and using this to prove it is true for k+1. Examples are provided to demonstrate proofs by mathematical induction for statements involving sums and sequences. Exercises at the end involve using induction to prove additional mathematical statements.

    Copyright:

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

    P P P P P: Mathematical Induction

    Uploaded by

    Taka
    The document introduces mathematical induction, which is a method of proof used to establish that a statement holds for all natural numbers. It involves two steps: 1) showing the statement is true for the base case, and 2) assuming the statement is true for some integer k and using this to prove it is true for k+1. Examples are provided to demonstrate proofs by mathematical induction for statements involving sums and sequences. Exercises at the end involve using induction to prove additional mathematical statements.

    Copyright:

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

    MATHEMATICAL INDUCTION

    Consider the following statements.

    P(1) : 1 = 12 (one term)

    P(2) : 1 + 3 = 22 (two terms)

    P(3) : 1 + 3 + 5 = 32 (three terms)

    P(4) : 1 + 3 + 5 + 7 = 42 (four terms)

    P(5) : 1 + 3 + 5 + 7 + 9 = 52 (five terms)


    ..
    Can we conclude that

    P(n) : 1 + 3 + 5 + + (2n 1) n2 (n terms),


    for every n = 1, 2, 3, 4, ?; or we just guess the conclusion?

    Now, consider the following statements.

    P(1) : 2(12 ) 1 1 = 13 is prime

    P(2) : 2(22 ) 11 = 19 is prime

    P(3) : 2(32 ) 11 = 29 is prime

    P(4) : 2(42 ) 11 = 43 is prime

    P(5) : 2(52 ) 11 = 61 is prime

    P(6) : 2(62 ) 11 = 83 is prime


    ..
    Can we conclude that

    P(n) : 2n2 11 is prime

    for every n = 1, 2, 3, 4, ?; or we just guess 2n2 11 is prime?

    PURWANTO 2014 1
    In the above cases we only guess the conclusions. In the first case, it is true that

    P(n) : 1 + 3 + 5 + + (2n 1) n2 (n terms),


    for every n = 1, 2, 3, 4, ; but in the second case it is false that

    2n2 11 is prime for every n = 1, 2, 3, 4, (why?).


    Thus we cannot conclude that P(n) is true for every n = 1, 2, 3, 4, by the cases
    P(1), P(2), P(3),..., P(k ) are true, for some k.

    If we can show that


    (1) P(1) is true
    (2) If P(1) is true then P(2) is true,
    if P(2) is true then P(3) is true,
    if P(3) is true then P(4) is true,
    if P(4) is true then P(5) is true,
    .
    then we can conclude that P(n) is true for every n = 1, 2, 3, 4, .

    In another words, if we can show that


    (1) P(1) is true
    (2) for all integers k 1, if P(k ) is true then P(k 1) is true
    then we can conclude that P(n) is true for all integers n 1.
    This is what we call Mathematical Induction.

    Principle of Mathematical Induction. Let P(n) be a statement, n a , n and a be


    nonnegative integer. If
    (1) P(a) is true
    and (2) for all integers k a, if P(k ) is true then P(k 1) is true,
    then P(n) is true, for all n a .

    PURWANTO 2014 2
    We need two steps to proof a statement by mathematical induction.
    step 1 ( the basis step): we show that P(a) is true
    step 2 (the inductive step): we show that all integers k a, if P(k ) is true then
    P(k 1) is true.
    In the inductive step, we suppose that for all integers k a, if P(k ) is true. Then
    we show that P(k 1) is true.

    Example 1. Prove that 1 + 3 + 5 + + (2n 1) n2 , for all integers n 1.

    Proof. We will show that P(n) : 1 + 3 + 5 + + (2n 1) n2 , for all integers n


    1 is true.

    Basis step: It is obvious that for n = 1, P(1) : 1 = 12 is true.


    Induction step: We will show that for all integers k 1, if P(k ) is true then
    P(k 1) is true.
    Suppose that for all integers k 1,

    P(k ) : 1 + 3 + 5 + + (2k 1) k 2 is true.


    Then

    1 + 3 + 5 + + (2k 1) (2(k 1) 1) = k 2 (2k 1)

    = (k 1) 2 ,

    P(k 1) : 1 + 3 + 5 + + (2k 1) (2(k 1) 1) = (k 1) 2 is true.

    We can write the above proof in a shorter way.

    Proof. For n = 1 it is true that 1 = 12 .


    Suppose that for any integer n = k, k 1,

    1 + 3 + 5 + + (2k 1) k 2 .
    Then, for n = k +1,

    1 + 3 + 5 + + (2k 1) (2(k 1) 1) = k 2 (2k 1)

    = (k 1) 2 .

    PURWANTO 2014 3
    Example 2. Prove that for all integers n 1, 22n 1 is divisible by 3.

    Proof: For n = 1. it is true that 22(1) 1 = 3 is divisible by 3.


    Suppose that for any integer n = k, k 1,

    22k 1 is divisible by 3.
    Then, for n = k + 1,

    22(k 1) 1 22k 2 1
    = 22 k 2 2 1

    = 22 k 4 1

    = 3( 22k ) + 22k 1.

    Since each of 3( 22k ) and 22k 1 is divisible by 3, then

    22(k1) 1 = 3( 22k ) + 22k 1


    is divisible by 3.

    Principle of Mathematical Induction, Strong form. Let P(n) be a statement,


    n a , n and a be nonnegative integer. If
    (1) P(a) is true
    and (2) for all integers n, a n k , if P(n) is true then P(k 1) is true,
    then P(n) is true, for all n a .

    Example 3. Prove that if n 2 is an integer, then n can be factored as a product of


    primes.
    Proof: If n = 2, then 2 is prime and it is its own factorization.
    Suppose for any n, 2 n k , n can be factored as a product of primes. Let n = k + 1.
    If n = k + 1 is prime, then it is its own factorization. If n = k + 1 is not prime, then
    n = k + 1 = pq, for some p and q with 2 p, q k . By induction hypothesis, p and q
    can be factored into primes, so pq can be factored into primes.

    PURWANTO 2014 4
    Exercises
    Prove each statement in 1 10 by mathematical induction.
    n(n 1)
    1. 1 + 2 + 3 + + n = .
    2
    n(n 1)(2n 1)
    2. 12 22 32 ... n2 .
    6
    3n1 3
    3. 3 3 3 ... 3
    2 3 n
    .
    2
    2
    n(n 1)
    4. 13 23 33 ... n3 .
    2

    5. For all integers n 1, 8n 1 is divisible by 7.

    6. For all integers n 0, n3 7n 3 is divisible by 3.

    7. For all integers n 1, 2n 2 n .


    n
    n(n 1)(n 2)
    8. i(i 1) 3
    .
    i 1

    9. For all integers n 1, x y is a factor of x 2n y 2n .


    10. For all integers n 2, a 0 , a 1 , bi 0 ,

    log a (b1b2 ...bn ) log a b1 log a b2 ... log a bn .

    11. Establish the following by induction (strong form):


    If u1 u 2 1, and for n 3 , u n u n1 u n2 , then

    1 1 5 n 1 1 5 n
    un ( ) ( )
    5 2 5 2
    12. Find the flaw (the mistake) in the following proof by mathematical induction.

    For all integers n 1, 3n 2 is even.

    Proof: Suppose that for any integer n = k, k 1, 3k 2 is even. Then, for n =


    k + 1,

    3k1 2 = 3k 3 2

    PURWANTO 2014 5
    = 3k 2 3k 2 .

    Since each of 3k 2 and 3k 2 is even, then 3k1 2 = 3k 2 3k 2 is even.

    PURWANTO 2014 6

    You might also like