Scribd Logo
Upload

Welcome to Scribd!

  • Mathematical Induction and Binomial Theorem - Exercise 8.3 - ClassNotes

    Uploaded by

    inameless2005
    3 views1 page
    The document summarizes the binomial theorem and mathematical induction. It provides two examples of using the binomial theorem to expand (1+x)2 and (1-x)2 as infinite sums. For both examples, it applies the binomial expansion formula, calculates the coefficients of the x terms, and verifies that the coefficient of the nx term is equal to n(n-1)/2.

    Original Description:

    Original Title

    Mathematical Induction and Binomial Theorem - Exercise 8.3 – ClassNotes

    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
    The document summarizes the binomial theorem and mathematical induction. It provides two examples of using the binomial theorem to expand (1+x)2 and (1-x)2 as infinite sums. For both examples, it applies the binomial expansion formula, calculates the coefficients of the x terms, and verifies that the coefficient of the nx term is equal to n(n-1)/2.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Mathematical Induction and Binomial Theorem - Exercise 8.3 - ClassNotes

    Uploaded by

    inameless2005
    The document summarizes the binomial theorem and mathematical induction. It provides two examples of using the binomial theorem to expand (1+x)2 and (1-x)2 as infinite sums. For both examples, it applies the binomial expansion formula, calculates the coefficients of the x terms, and verifies that the coefficient of the nx term is equal to n(n-1)/2.

    Copyright:

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

    !

    "

    Mathematical Induction and Binomial


    Theorem – Exercise 8.3
    by Editor | Maths

    ++

    1 + x2
    i.
    ( 1)+ x 2
    Solution

    Page 18 of 51
    www.classnotes.xyz Mathematics ClassNotes, Inc. © 2020 18

    (1)+1( 1x)(2) =+ + x 2x 2 -
    1+ x 2
    é (ù)-( -- ) ( -) (--) (--) (=+
    ) (+) ê ú2-21
    + 2+ 21
    + 22
    1 1 xx22.......
    x23x 2! 3!
    ëû
    = (+1)é1 x2ù2xx
    3-2+4x3-........
    +ëû

    = (+1)-{1+
    x22xx
    -32+4
    x3 .....
    +111 +-(2n
    ( -) -( )n --)1n-n2-xn1nx
    + 1 1 .......} ( -) + ( )n+ nn x
    Now the team involving nx
    is ( -) +
    (n)+(nnx -2
    1111 -) n-( nx
    )n
    = (-)é1( ù11
    ) (+n1n) +nx
    n - - ë û -2

    = (-)+1[ +1n
    ] (1-nn)12
    =nn
    [ -]nx nx
    Thecoe!cient
    n of nx =n
    1 (2
    -) [ ]
    Hence
    ClassNotes ,

    ( 1)+ x 2
    ii.
    ( 1)- x 2
    Solution
    ( 1)+ x- 2
    ( )=( )+(-) - 1 1 x x2 2
    1 x2
    é (ù)-( --
    ) ( -) (--) (--) (=+ ) (+) +
    ( )ê( ú) (-)- +2- 21
    + -2+21 2 2
    1 2 1xx x 2x x23
    2 ...... 2! 3!
    ëû
    =+( 1)+2+1xx
    +2 +3x +4
    2x éx2 ù3 ë û
    ......
    =+( 1)+2+1 +2 +3 +4 é......
    ù3 ë û
    xx x 2x x2
    ( n) -(x)+nx++
    + 1 1 .........] n-2+x-n
    nn 1
    Now the term involving
    n nn ( nn)1++
    x is (x2)nx
    1+ -n x
    = [++
    (]n1)nn
    +2-1
    = [ ]n4x n
    Hencethe n turm involvingnx=4

    Page 18 / 51

    Advertisement

    Submit a Comment
    Your email address will not be published. Required fields are marked *

    Comment *

    Name

    Email

    Website

    I'm not a robot


    reCAPTCHA
    Privacy - Terms

    Submit Comment

    Prepare NUST Entrance Test

    Advertisement

    Prepare and Ace Your NUST Entrance Test (NET)


    ClassNotes - Prepare NET

    Latest News

    ClassNotes @classnotesxyz · May 7


    Visit class-notes.com and start preparing your board exams and
    NUST Entrance Test now!!!

    #FBISE #NET #NUST #ClassNotes #elearning

    4 7

    Advertisement

    ABOUT US TERMS OF USE DMCA PRIVACY POLICY CONTACT US

    © 2022 ClassNotes, Inc. | All Rights Reserved

    You might also like