离散数学杨争锋ch041.pptxVIP

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

Chapter 4 Counting (计数)§4.1 The Basics of Counting§4.2 The Pigeonhole Principle§4.3 Permutations and Combinations§4.4 Binomial Coefficients§4.5 Generalized Permutations and Combinations§4.6 Generating Permutations and C 牛牛文库文档分享§4.1 The Basics of CountingIntroduction Example 0 (page 301) A password on a computer system consists of six, seven, or eight characters. Each of these characters must be a digit or a letter of the alphabet. Each password must contain at least one digit. How many such passwords are there? 牛牛文库文档分享2. Basic Counting PrinciplesThe Product Rule (乘法法则) Suppose that a procedure can be broken into a sequence of two tasks. If there are n1 ways to do the first task and n2 ways to do the second task after the first task has been done, then there are n1n2 ways to do the 牛牛文库文档分享(2) Examples (a) Example 1 (page 302) The chair of an auditorium (礼堂) are to be labeled with a letter and a positive integer not exceeding 100. What is the largest number of chairs that can be labeled differently?Solution: See blackboard or 牛牛文库文档分享 (b) Example 2 (page 302) There are 32 microcomputers in a computer center. Each microcomputer has 24 ports. How many different ports to a microcomputer in the center are there?Solution: See blackboard or 牛牛文库文档分享(3) Extended Version of the Product RuleSuppose that a procedure is carried out by performing the tasks T1, T2, …, Tm in sequence. If task Ti can be done in ni ways after tasks T1, T2, …, and Ti-1 have been done, then there are n1×n2×…×nm ways to carry out the 牛牛文库文档分享 (4) Examples (a) Example 3 (page 302) How many different bit strings are there of length seven? Solution: See blackboard or 牛牛文库文档分享 (b) How many different license plate are available if each plate contains a sequence of three letters followed by three digits (and no sequences of letters are prohibited, even if they are obscene)Solution: See blackboard or 牛牛文库文档分享 (c) Example 5 (page 303) Counting functions How many functions are there from a set of m ele

文档评论(0)

131****9843 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档