1 / 18

Main Menu (Click on the topics below)

Click on the picture. Main Menu (Click on the topics below). Algebra of Combinations Pascal’s formula More Formulas. Sanjay Jain, Lecturer, School of Computing. Algebra of Combinations. Sanjay Jain, Lecturer, School of Computing. 1. Simplification 2. Proving some equalities.

trynt
Download Presentation

Main Menu (Click on the topics below)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Click on the picture Main Menu (Click on the topics below) Algebra of Combinations Pascal’s formula More Formulas Sanjay Jain, Lecturer, School of Computing

  2. Algebra of Combinations Sanjay Jain, Lecturer, School of Computing

  3. 1. Simplification 2. Proving some equalities. 3. Different ways of seeing the same problem. Algebra of Combinations For 1  r  n For r > n For 0  n

  4. END OF SEGMENT

  5. Theorem: Suppose 0  r  n Method 1: Method 2: Choosing r objects from a set of n objects is same as leaving out n-r objects. Thus,

  6. END OF SEGMENT

  7. Theorem: Pascal’s Formula Suppose 1  r  n Job: Choose r objects from a set of n+1 objects. Calculate in two ways: A) B) (i) Choose the first object, and r-1 of the remaining n objects OR (ii) Do not choose the first object, and choose r of the remaining n objects Answer should be sum of the ways in which (i) and (ii) can be done.

  8. END OF SEGMENT

  9. Pascal’s Formula Continued We can use Pascal’s Formula to derive new formulas as follows: Suppose 2  r  n

  10. Pascal’s Formula Continued Choosing r out of n+2 objects can be done as follows: (i) Choose the first two objects, and r-2 of the remaining n objects OR (ii) Choose one of the first two objects and choose r-1 of the remaining n objects OR (iii) Choose none of the first two objects and choose r of the remaining n objects. Number of ways of choosing r out of n+2 objects should be sum of the ways in which (i), (ii) and (iii) can be done.

  11. END OF SEGMENT

  12. Generalized Pascal’s Formula Generalizing we get:

  13. END OF SEGMENT

  14. More Formulas Suppose 0  r  n You can prove above by substituting the formulas for combinations. Problem: Choose a committee of size r+1, with a leader, from a group of size n. A) Choose a committee of size r+1, and then choose a leader among them. B) Choose a committee of size r, and then choose a leader among the remaining n-r people. Answer should be same from both the methods.

  15. More Formulas A) Choose a committee of size r+1, and then choose a leader among them. Choosing a committee of size r+1: Choosing a leader: (r+1) ways. Choosing the committee with the leader:

  16. Choosing a committee of size r (without leader): Choosing the committee with the leader: More Formulas B) Choose a committee of size r, and then choose a leader among the remaining n-r people. Choosing a leader: (n - r) ways.

  17. More Formulas

  18. END OF SEGMENT

More Related