1 / 22

Combinatorics - the art of counting

Combinatorics - the art of counting. A. B. C. There are 3 different routes to go from A to B. There are 2 different routes to go from B to C. How many different routes are there to go from A to C?. Answer is 6. A. B. C. m. n. There are m different routes to go from A to B.

esperanza
Télécharger la présentation

Combinatorics - the art of counting

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. Combinatorics - the art of counting

  2. A B C There are 3 different routes to go from A to B. There are 2 different routes to go from B to C. How many different routes are there to go from A to C? Answer is 6

  3. A B C m n There are m different routes to go from A to B. There are n different routes to go from B to C. How many different routes are there to go from A to C? Answer is m*n

  4. 3 5 8 How many 3-digit numbers can be formed arranging the digits “3”, “5” and “8”? • 358 • 385 • 538 • 583 • 835 • 853 Answer is 6

  5. 3 5 4 7 9 How many 5-digit numbers can be formed arranging the above 5 digits? The answer is 120. It is hard to list down all the arrangements and count the number to be 120. We need a counting technique.

  6. 3 5 4 7 9 There are 5 digits as above. I II III IV V Consider 5 vacant positions as above. The number of ways these 5 vacant positions can be filled by these 5 digits will give me the answer.

  7. 3 5 4 7 9 Digits I II III IV V Positions Ways 5 4 3 2 1 Total number of arrangements = 5 * 4 * 3 * 2 * 1 = 120

  8. A1 A2 An Objects P1 P2 Pn Positions Ways n n-1 1 Total number of arrangements = n * (n-1) * . * . * 1 = n!

  9. 3 5 4 7 How many 2-digit numbers can be formed arranging the above 4 digits? Answer is 12 • 35 • 34 • 37 • 53 • 54 • 57 • 43 • 45 • 47 • 73 • 75 • 74 Let us apply our newly learnt counting technique

  10. 3 5 4 7 Digits I II Positions Ways 4 3 Total number of arrangements = 4 * 3 = 12

  11. A1 A2 An Objects In how many ways the above n objects can be arranged among themselves taking r (r < n) objects at a time? We call the number npr

  12. A1 A2 An Objects P1 P2 Pr Positions Ways n n-1 n-r+1 Total number of arrangements = n * (n-1) * . * . * (n-r+1) = n! / (n-r)!

  13. A1 A2 An Objects In how many ways the above n objects can be grouped among themselves taking r (r < n) objects at a time? We call the number ncr

  14. Consider ncr groups of n objects taking r at a time Each group contains r objects that can be arranged among themselves in r! ways So, npr = r!ncr

  15. ncr = npr / r! = n! / [r! (n-r!)] ncr = nc(n-r) ncr = (n-1)cr + (n-1)c(r-1)

  16. A A A B C In how many ways the above 5 objects can be arranged among themselves taking all at a time? Let the answer be x

  17. A A A B C Had the all 5 objects been different, the total number of arrangements would have been 5! = 120 Had the all 5 objects been different, each of the x arrangements would have produced 3! = 6 arrangements

  18. A A A B C So, 3! * x = 5! Or, x = 5! / 3! = 120 / 6 = 20

  19. B A Consider the 2 by 2 grid above One needs to travel from A to B along the lines One can move only rightwards and upwards How many such routes are there?

  20. B A 1. RRUU The answer is 6 2. RURU 3. RUUR 6 = 4! / (2! 2!) 4. URUR 5. URRU 6. UURR

  21. Consider an m by n grid Suppose one needs to travel from bottom left hand corner to top right hand corner following the lines How many different routes are there? Answer is (m+n)! / (m! * n!)

  22. THANK YOU

More Related