Scribd Logo
Upload

Welcome to Scribd!

  • Math Presantation

    Uploaded by

    emanibraheem765
    18 views4 pages
    This document contains proofs by mathematical induction of three equations: 1) 1+2+3+...+n = n(n+1)/2 for n > 1 2) 1+2+3+...+(2n) = n(n+1) 3) (1)^2 + (2)^2 + (3)^2 +...+ (n)^2 = (n+1)(2n+1)/6 The proofs establish the base case and use induction to show that if the equation holds for k, it also holds for k+1, thereby proving the equation true for all positive integers n.

    Original Description:

    Original Title

    math presantation

    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 proofs by mathematical induction of three equations: 1) 1+2+3+...+n = n(n+1)/2 for n > 1 2) 1+2+3+...+(2n) = n(n+1) 3) (1)^2 + (2)^2 + (3)^2 +...+ (n)^2 = (n+1)(2n+1)/6 The proofs establish the base case and use induction to show that if the equation holds for k, it also holds for k+1, thereby proving the equation true for all positive integers n.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    18 views4 pages

    Math Presantation

    Uploaded by

    emanibraheem765
    This document contains proofs by mathematical induction of three equations: 1) 1+2+3+...+n = n(n+1)/2 for n > 1 2) 1+2+3+...+(2n) = n(n+1) 3) (1)^2 + (2)^2 + (3)^2 +...+ (n)^2 = (n+1)(2n+1)/6 The proofs establish the base case and use induction to show that if the equation holds for k, it also holds for k+1, thereby proving the equation true for all positive integers n.

    Copyright:

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

    Q1= PROVE THAT:

    1+2+3………+n = n(n+1) where n>1 ?


    Basis :
    ( 1 ) (1+1)
    1= 2

    ( 1 ) (2)
    1=
    2

    2
    1 ¿2
    1=1
    L.H.S=R.H.S

    Induction:
    k +1(k +1+ 1)
    1+2+3+…….+k+1= 2

    ( k +1 ) ( k +2)
    1+2+3+…….+k+k+1= 2

    k (k +1) ( k +1 ) ( k +2)
    2 +k+1= 2

    Multiply by 2
    (k + 1) ( k +1 ) (k +2)
    2( 2 )+2(k+1)=( 2 )
    K(k+1)+2(k+1)=(k+1)(k+2)
    (k+1)(k+2)=(k+1)(k+2)
    L.H.S=R.H.S

    Q2= PROVE THAT:


    1+2+3+…….+( 2 ) =2 _1 n n +1

    Basis:
    1=( 2 ) 0 +1
    1

    1= ( 2 ) 1
    1

    1=1
    L.H.S=R.H.S

    Induction:
    1+2+3+…….+( 2 ) +( 2 ) _1 k k +2

    ( 2 )k +1_1+( 2 ) k +1 k+ 2
    =( 2 )1

    +
    ( 2 ) K+ 1 ( 2 ) K+ 1 _1=( 2 ) _1 K+ 2

    ( 2 ) K+ 1 (1+1)_1)= ( 2 ) _1 K+ 2

    ( 2 ) K+ 1 (2)_1=( 2 ) _1 K+ 2

    ( 2 ) K+ 1+1 _1=( 2 ) _1 K+ 2

    ( 2 ) K+ 2 _1=( 2 ) _1 K+ 2

    L.H.S=R.H.S
    Q3: PROVE THAT:
    + + +…….+ ( n ) =(n+1) (2n+1)/6
    ( 1 )2 ( 2 )2 ( 3 )2 2

    Basis:
    ( 1 )2 =1 (1+1)(2(1)+1)/6
    1=1(2)(3)/6
    1=1
    L.H.S=R.H.S

    Induction:
    + + +…….+( k ) =k(k+1)(2k+1)/6
    ( 1 )2 ( 2 )2 ( 3 )2 2

    + + +…….+( k ) +( k +1 )
    ( 1 )2 ( 2 )2 ( 3 )2 2 2

    + + +…….+( k ) =(k+1)(k+1+1)(2(k+1)+1)/6k(k+1)
    ( 1 )2 ( 2 )2 ( 3 )2 2

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

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

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

    (k+1)(2k+3)(k+2)/6=(k+1)(K+2)(2k+3)/6
    There fore , by principal of mathematical induction :( 1 ) +( 2 )
    2 2

    +( 3 ) +…….+ ( n ) =(n+1) (2n+1)/6


    2 2
    For all positive integers.

    You might also like