Scribd
Upload
25 views13 pages

Week3 Pptweek4x

This document provides an overview of topics covered in Week 4 of a discrete mathematics course, including: 1. Counting techniques using binomial coefficients, binomial identities, and combinatorial proofs. Binomial coefficients represent the number of combinations of picking k items from a set of n items. Binomial identities equate two expressions involving binomial coefficients. 2. Combinatorial proofs involve demonstrating an identity by showing two counting methods produce the same result. For example, the identity relating the binomial coefficients of picking k items from n items and n-k items from n items. 3. Examples are given of calculating binomial coefficients and using a binomial identity for a combinatorial proof. Combinatorial proofs provide

Uploaded by

Kenny Stephen Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views13 pages

Week3 Pptweek4x

This document provides an overview of topics covered in Week 4 of a discrete mathematics course, including: 1. Counting techniques using binomial coefficients, binomial identities, and combinatorial proofs. Binomial coefficients represent the number of combinations of picking k items from a set of n items. Binomial identities equate two expressions involving binomial coefficients. 2. Combinatorial proofs involve demonstrating an identity by showing two counting methods produce the same result. For example, the identity relating the binomial coefficients of picking k items from n items and n-k items from n items. 3. Examples are given of calculating binomial coefficients and using a binomial identity for a combinatorial proof. Combinatorial proofs provide

Uploaded by

Kenny Stephen Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

WEEK 4

COUNTING

CS-6105 Discrete Mathematics


WEEK 4 : COUNTING
Module Learning Outcomes:

By the end of this module, a student is able to:


1. Understand the combinational proofs.
2. Understand binomial coefficients and identities.
3. Create the equation to support a combinational proof.
Topics Covered

• Counting
- Binomial Coefficients
- Binomial Identity
COUNTING
- Combinatorial Proofs
Binomial Coefficients
The binomial coefficient    is the number of ways of picking   unordered outcomes from   possibilities,
also known as a combination or combinatorial number.
The symbols    and   are used to denote a binomial coefficient, and are sometimes read as "  choose  ."
therefore gives the number of k-subsets possible out of a set of   distinct items.
For example, The 2-subsets of {1,2,3,4} are the six pairs  {1,2} ,{1,3},{1,4},{2,3},{2,4}, and {3,4}, so  .
The number of lattice paths from the origin (0,0) to a point (a,b) is the binomial coefficient    (Hilton and
Pedersen 1991).
 
Binomial Identity
- an identity (i.e.,equation) involving binomial coefficients

 
Binomial Identity
Example :

 
Binomial Identity
Example :

 
Combinatorial Proofs
In general, to give a combinatorial proof for a binomial identity, say A B you do the following :
Combinatorial Proofs
Combinatorial Proofs
Combinatorial Proofs
Combinatorial Proofs
END

You might also like