组合数学课件Lecture-3.pptVIP

  1. 1、本文档共33页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
组合数学课件Lecture-3.ppt

* Comments The number of r-combinations of a multiset S equals to the number of non-negative integer solutions of the equation x1 + x2 +x3 +…+xk = r. In the case the repetition number is limited in a multiset, the problem is more complex and difficult. That will be introduced in Chapter 6. * Assignments Third Edition: 4(a), 8, 18, 31 Consider an 9-by-9 board and 9 rooks of which 5 are red and 4 are blue. Suppose you place the rooks on the board in non-attacking positions at random. What is the probability that the red rooks are in rows 1, 3, 5, 7, 9? What is the probability that the red rooks are both in rows 1,2,3,4,5 and in columns 1,2,3,4,5? Fifth Edition: 4(a), 9, 19, 38, 61 2005-2006, Hejiao Huang Module #15 - Combinatorics * Lecture 3 Permutations and combinations * Summary Addition and multiplication principle Permutations of sets Combinations of sets Permutations of multi-sets Combinations of multi-sets * Addition and multiplication principles Let m be the number of ways to do task 1 and n the number of ways to do task 2 (with each number independent of how the other task is done), and assume that no way to do task 1 simultaneously also accomplishes task 2. The addition principle: The task “do either task 1 or task 2, but not both” can be done in m+n ways. The multiplication principle: The task “do both task 1 and task 2” can be done in mn ways. * Set Theoretic Version If A is the set of ways to do task 1, and B the set of ways to do task 2, and if A and B are disjoint, then: The ways to do either task 1 or 2 are A?B, and |A?B|=|A|+|B| The ways to do both task 1 and 2 can be represented as A?B, and |A?B|=|A|·|B| * Examples A student wishes to take either a mathematical course or a biology course, but not both. If there are 4 mathematics and 3 biology courses for which the student has the necessary prerequisites, then the student can choose a course to take in 4+3=7 ways. A student is to take two courses. The first meets at any one of 3 hours i

文档评论(0)

heroliuguan + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8073070133000003

1亿VIP精品文档

相关文档