Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Jessica O'Hara: 0 1 k+1 K K 1 N N

    Uploaded by

    Bludimir Clawgsburg
    The document provides a proof by mathematical induction that for a sequence defined by a0 = 2, a1 = 3, and ak+1 = 3ak - 2ak-1, we have an = 2n + 1 for all integers n ≥ 0. The base cases of n = 0 and n = 1 are first shown to hold. It is then assumed the statement holds for some integer k ≥ 1. Using the recursive definition and inductive hypothesis, it is shown that ak+1 = bk+1, completing the inductive step. Therefore, by the principle of mathematical induction, an = 2n + 1 for all integers n ≥ 0.

    Copyright:

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

    Jessica O'Hara: 0 1 k+1 K K 1 N N

    Uploaded by

    Bludimir Clawgsburg
    7 views2 pages
    The document provides a proof by mathematical induction that for a sequence defined by a0 = 2, a1 = 3, and ak+1 = 3ak - 2ak-1, we have an = 2n + 1 for all integers n ≥ 0. The base cases of n = 0 and n = 1 are first shown to hold. It is then assumed the statement holds for some integer k ≥ 1. Using the recursive definition and inductive hypothesis, it is shown that ak+1 = bk+1, completing the inductive step. Therefore, by the principle of mathematical induction, an = 2n + 1 for all integers n ≥ 0.

    Original Description:

    Original Title

    A3_Q2_P1

    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 provides a proof by mathematical induction that for a sequence defined by a0 = 2, a1 = 3, and ak+1 = 3ak - 2ak-1, we have an = 2n + 1 for all integers n ≥ 0. The base cases of n = 0 and n = 1 are first shown to hold. It is then assumed the statement holds for some integer k ≥ 1. Using the recursive definition and inductive hypothesis, it is shown that ak+1 = bk+1, completing the inductive step. Therefore, by the principle of mathematical induction, an = 2n + 1 for all integers n ≥ 0.

    Copyright:

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

    Jessica O'Hara: 0 1 k+1 K K 1 N N

    Uploaded by

    Bludimir Clawgsburg
    The document provides a proof by mathematical induction that for a sequence defined by a0 = 2, a1 = 3, and ak+1 = 3ak - 2ak-1, we have an = 2n + 1 for all integers n ≥ 0. The base cases of n = 0 and n = 1 are first shown to hold. It is then assumed the statement holds for some integer k ≥ 1. Using the recursive definition and inductive hypothesis, it is shown that ak+1 = bk+1, completing the inductive step. Therefore, by the principle of mathematical induction, an = 2n + 1 for all integers n ≥ 0.

    Copyright:

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

    MATH 1200 - ASSIGNMENT 3: PART 1

    JESSICA O’HARA

    Conjecture: When a0 = 2 and a1 = 3, for every positive integer k, ak+1 = 3ak − 2ak−1 then
    an = 2n + 1, for every integer n ≥ 0.
    Proof. Let an , where n ≥ 0, be a sequence of integers defined by recursively by a0 = 2, a1 = 3
    and ak+1 = 3ak − 2ak−1 , for every positive integer k. Let bn , where n ≥ 0, be defined by the
    formula bn = 2n + 1. Let P (n) be an = bn for every integer n ≥ 0, and we want to prove P (n)
    for every integer n ≥ 0/. We will use proof by extended principle of mathematical induction.

    Base Case: Prove P (0) and P (1). We want to show a0 = b0 and a1 = b1

    b0 = 20 + 1 = 2 = a0 (1)

    b1 = 21 + 1 = 3 = a1 (2)
    Therefore, P (0) and P (1) are proved.

    Inductive Step: Prove P (0) + P (1) + ... + P (k) + P (k + 1) for some positive integer k.

    Inductive Hypothesis: Assume aj = bj for every integer j such that 0 ≤ j ≤ k for


    some positive integer k. We want to prove ak+1 = bk+1 . Since a positive integer k is k ≥ 1,
    k + 1 ≥ 2 so that ak+1 = 3ak − 2ak−1 . Moreover, since k ≥ 1, k − 1 ≥ 0 so that 0 ≤ k − 1 < k
    and 0 ≤ k ≤ k. By the inductive hypothesis, ak−1 = bk−1 and ak = bk .

    ak+1 = 3ak − 2ak−1 (3)

    = 3bk − 2bk−1 (4)

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

    = 3(2k + 1) − 2(2k−1 + 1) (6)

    = 3 · 2k + 3 − 2 · 2k−1 − 2 (7)

    = 3 · 2k − 2k + 3 − 2 (8)

    = 2 · 2k + 1 (9)

    = 2k+1 + 1 (10)
    Date: March 4, 2023.
    1
    2 JESSICA O’HARA

    = bk+1 (11)
    Therefore, P (k + 1) is proved and by the second principle of mathematical induction,
    an = 2n + 1, for every integer n ≥ 0, as required.
    □

    You might also like