Scribd Logo
Upload

Welcome to Scribd!

  • Proof by Induction 2

    Uploaded by

    steven octavianus
    5 views2 pages
    1. The document proves by induction that the expression 1121 + 29h + 22 is divisible by 21 for all non-negative integers n. 2. It also proves by induction that the expression Sn = (n+1)! - 1 is equal to 1 for all positive integers n. 3. The inductive proofs involve assuming the expressions are true for an integer k, and then showing they are also true for k+1 based on the assumption for k.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document proves by induction that the expression 1121 + 29h + 22 is divisible by 21 for all non-negative integers n. 2. It also proves by induction that the expression Sn = (n+1)! - 1 is equal to 1 for all positive integers n. 3. The inductive proofs involve assuming the expressions are true for an integer k, and then showing they are also true for k+1 based on the assumption for k.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views2 pages

    Proof by Induction 2

    Uploaded by

    steven octavianus
    1. The document proves by induction that the expression 1121 + 29h + 22 is divisible by 21 for all non-negative integers n. 2. It also proves by induction that the expression Sn = (n+1)! - 1 is equal to 1 for all positive integers n. 3. The inductive proofs involve assuming the expressions are true for an integer k, and then showing they are also true for k+1 based on the assumption for k.

    Copyright:

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

    ① 1121 + as" + 22

    a . n= 1 ,
    115+ as' + 22 = = &
    b .

    n =
    R ,
    1124 + 25" + 22 &M (assume trace =

    C a
    assume =
    k+

    II
    2x +2
    + 29Ht + 22

    1122 /12 ·
    + 292 .

    25 + 22

    (120 + 1) (124 +
    (2n 1) 2Sk
    + + 22

    (120 ·

    254) (114 25 22)


    1124 + 24 =
    + + +

    /12" ask) + OM
    2u)s +
    .

    P :
    -

    divisible

    , by
    induction , 1121 + 29h + 22 is divisible by 21
    honee
    for all non-negative integers

    2 Si =
    U1 =
    141 !

    - 2! -
    Si = 2 ! -
    1x1 ! =
    11(2 + ) =
    1

    >
    - 3 ! -
    Su = 3!
    -

    (2x2 ! + (x1 ! ) =
    1

    >
    -
    u! -

    Sz =
    y!
    -

    (3x3 ! + 2x2 ! +
    (x)!) =
    1

    >
    -
    s ! -

    Su = S! -
    (4x4 ! + 3x3 ! + 2x2 ! +
    (x))) =
    /
    120 -
    16 -

    18 -

    u
    -
    1 =
    /

    Sn = (n + 1) ! -

    when n= 1 , S = 2 ! -1
    =
    10
    assume n = k

    >
    -
    Sa = (k+ 1) ! -

    n = k+ 1

    >
    -
    Su+ 1 =
    Su + UK+
    = (R + 1) ! -
    1 + (n+ 1)(k+ 1) !
    =
    (n+ 1) ! ( 1 + n + 1) -
    1
    =
    (n + 1) ! (n + 2) -
    1
    =
    (k + 2) ! 1 -

    =
    ((k + 1) + 1)! -

    By induction , Sa =
    (n+ 1) ! -1 for
    all positive integers

    You might also like