Scribd Logo
Upload

Welcome to Scribd!

  • INDUCCION

    Uploaded by

    TimePlay
    5 views2 pages
    This document contains mathematical equations for proving inductive steps. It begins with base cases of m=1 and m=k proving equalities. It then proves the inductive step of m=k+1, showing that if the equality holds for m=k, then it also holds for m=k+1 by performing algebraic manipulations of the equations. The overall proof is that the given equalities hold true for all positive integer values of m.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains mathematical equations for proving inductive steps. It begins with base cases of m=1 and m=k proving equalities. It then proves the inductive step of m=k+1, showing that if the equality holds for m=k, then it also holds for m=k+1 by performing algebraic manipulations of the equations. The overall proof is that the given equalities hold true for all positive integer values of m.

    Copyright:

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

    INDUCCION

    Uploaded by

    TimePlay
    This document contains mathematical equations for proving inductive steps. It begins with base cases of m=1 and m=k proving equalities. It then proves the inductive step of m=k+1, showing that if the equality holds for m=k, then it also holds for m=k+1 by performing algebraic manipulations of the equations. The overall proof is that the given equalities hold true for all positive integer values of m.

    Copyright:

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

    EJERCICIO 3

    m=1

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

    m=k

    5 + 9 + 13 + …… + ( 4(k) + 1) = k (2(k) + 3)

    m=k+1

    5 + 9 + 13 + …… + ( 4(k) + 1) + ( 4 ( k+ 1) + 1) = (k + 1) (2(k + 1) + 3)
    k (2(k) + 3) + ( 4k + 5) = (k +1) (2k + 5)
    2k^2 + 3k + 4k + 5 = 2k^2 + 5k + 2k + 5

    2k^2 + 7k + 5 = 2k^2 + 7k + 5

    m=1

    (1 . ( 1 +1 ) ) = ( 1 ( 1 + 1 ) ( 1 + 2) ) / 3}
    2 = 1 (2)(3) / 3
    2=2

    m=k

    1.2 + 2.3 + 3.4 + ….. + (k . ( k +1 ) ) = ( k ( k + 1) ( k + 2) ) / 3

    m= k+1

    1.2 + 2.3 + 3.4 + ….. + (k . ( k +1 ) ) + ( ( k + 1 )( k + 2) = ( (k + 1) ( (k + 1) + 1 ) ( (k + 1)+ 2) ) / 3

    ( k ( k + 1) ( k + 2) ) / 3 + ( ( k + 1 )( k + 2) = (k + 1) ( ( k + 2) ( k + 3) ) / 3
    ( k^3 + 3k + 2k ) / 3 + ( k^2 + 3k + 2 ) = ( ( k + 1) (k^2 + 3k + 2k + 6) ) /3

    (k^3 + 6k^2 + 11k + 6) / 3 = (k^3 + 6k^2 + 11k + 6) / 3

    You might also like