DOC PREVIEW
GSU CSC 2510 - ch03s6

This preview shows page 1-2 out of 6 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 6 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Set, Combinatorics, Probability, and Number TheoryPascal’s TriangleSlide 3Slide 4Binomial TheoremExercisesSet, Combinatorics, Probability, and Number TheoryMathematical Structures for Computer ScienceChapter 3Copyright © 2006 W.H. Freeman & Co. MSCS Slides Set, Combinatorics, Probability & Number TheorySection 3.6 Binomial Theorem 2Pascal’s TriangleConsider the following expressions for the binomials:(a + b)0 = 1(a + b)1 = a + b(a + b)2 = a2 + 2ab + b2(a + b)3 = a3 + 3a2b + 3ab2 + b3(a + b)4 = a4 + 4a3b + 6a2b2 + 4ab3 + b4Row n of the triangle (n  0) consists of all the values C(n, r) for 0  r  n. Thus, the Pascal’s looks like this: Row C(0,0) 0 C(1,0) C(1,1) 1 C(2,0) C(2,1) C(2,2) 2 C(3,0) C(3,1) C(3,2) C(3,3) 3 C(4,0) C(4,1) C(4,2) C(4,3) C(4,4) 4 C(5,0) C(5,1) C(5,2) C(5,3) C(5,4) C(5,5) 5C(n,0) C(n,1) ….………… C(n,n1) C(n,n) nSection 3.6 Binomial Theorem 3Pascal’s TriangleThe Pascal’s triangle can be written as: C(0,0) C(1,0) C(1,1)C(2,0) C(2,1) C(2,2) C(3,0) C(3,1) C(3,2) C(3,3)C(4,0) C(4,1) C(4,2) C(4,3) C(4,4) C(5,0) C(5,1) C(5,2) C(5,3) C(5,4) C(5,5) . .……….C(n,0) C(n,1) ………. C(n,n  1) C(n,n)We note that C(n,k) = C(n  1,k  1) + C(n  1,k) for 1 k  n  1Can be proved simply by expanding the right hand side and simplifying.Section 3.6 Binomial Theorem 4Pascal’s Triangle Coefficients Power0 0 1 1 1 1 2 1 21 3 3 1 3 1 4 6 4 1 4 1 5 10 10 5 1 5Section 3.6 Binomial Theorem 5Binomial TheoremThe binomial theorem provides us with a formula for the expansion of (a + b)n.It states that for every nonnegative integer n:The terms C(n,k) in the above series is called the binomial coefficient.Binomial theorem can be proved using mathematical induction.€ a +b( )n=C(n,0)anb0+C(n,1)an − 1b1+C(n,2)an − 2b2+....+C(n,n− k)akbn − k+.... +C(n,n−1)a1bn − 1+C(n,n)anb0 = C(n,k)an − kbkk=0n∑Section 3.6 Binomial Theorem 6ExercisesExpand (x + 1)5 using the binomial theoremC(5,0)x5 + C(5,1)x4 + C(5,2)x3 + C(5,3)x4 + C(5,4)x1 + C(5,0)x0Expand (x  3)4 using the binomial theoremThe fifth term of (3a + 2b)7What is the coefficient of x5y2z2 in the expansion of (x + y + 2z)9 ?Use binomial theorem to prove that:C(n,0) – C(n,1) + C(n,2) - …….+ (-1)nC(n,n) =


View Full Document

GSU CSC 2510 - ch03s6

Documents in this Course
ch02s2

ch02s2

5 pages

ch04s2

ch04s2

8 pages

ch01s6

ch01s6

10 pages

ch01s1

ch01s1

21 pages

ch02s4

ch02s4

10 pages

ch08s2

ch08s2

21 pages

ch08s3

ch08s3

15 pages

ch07s3

ch07s3

21 pages

ch04s3

ch04s3

23 pages

ch06s3

ch06s3

16 pages

ch01s3

ch01s3

15 pages

ch03s4

ch03s4

11 pages

ch03s5

ch03s5

9 pages

ch06s2

ch06s2

9 pages

ch03s1

ch03s1

19 pages

ch07s1

ch07s1

11 pages

ch02s1

ch02s1

14 pages

ch08s1

ch08s1

15 pages

ch02s5

ch02s5

9 pages

ch01s4

ch01s4

13 pages

Load more
Download ch03s6
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view ch03s6 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view ch03s6 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?