The Fundamental Counting Principle - Salisbury … 13641：基本的计算原则——索尔兹伯里…… 13641.docxVIP

下载本文档

10
0
约1.66万字
约 24页
2018-05-06 发布于江西
举报
版权申诉

The Fundamental Counting Principle - Salisbury … 13641：基本的计算原则——索尔兹伯里…… 13641.docx

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

The Fundamental Counting Principle - Salisbury … 13641：基本的计算原则——索尔兹伯里…… 13641

COUNTING METHODS1. Fundamental Counting Principle – pg. 66-75Assignment: pg. 73-75 #1-16, 202. Permutations and Factorial Notation – pg. 76-83Assignment: pg. 81-83 #1-163. Permutations When All Objects Are Distinguishable – pg. 84-95Assignment: pg. 93-95 #1-174. Mid-Chapter Review – pg. 96-97Assignment: pg. 97 #1-135. Permutations With Repetitions – pg. 98-107Assignment: pg. 104-107 #1-186. Combinations – pg. 109-120Assignment: pg. 118-120 #1-207. Solving Counting Problems – pg. 121-128Assignment: pg. 126-128 #1-168. Chapter Quiz9. Chapter Review – pg. 130-132Assignment: pg. 131-132 #1-1910. Chapter ExamFUNDAMENTAL COUNTING PRINCIPLELearning Outcomes:Represent and solve counting problems, using a graphic organizerGeneralize, using inductive reasoning, the fundamental counting principleIdentify and explain assumptions made in solving a counting problemSolve a contextual problem, using the fundamental counting principle, and explain the reasoningWork with a partner:Investigation:1. How many different ways can 3 friends line up to buy movie tickets? List all the possible arrangements of the three people.(1, 2, 3)(1, 3, 2)(2, 1 3)(2, 3, 1)(3, 1, 2)(3, 2, 1)There is an easier way!!2. Think of the 3 people who lining up as stages.Stage 1: possible first person in lineStage 2: possible second person in lineStage 3: possible third person in line3. Now think of the amount of choices of people you have at each stage.______ ______ ______ Stage 1 Stage 2 Stage 34. Multiply the values of each stage together. What value did you get? Have you seen this value before?This scenario tells us the amount of different arrangements 3 people can have when lining up to buy movie tickets. Hence:The Fundamental Counting PrincipleConsider a task made up of several stages. If the number of choices for the first stage is a, the number of choices for the second stage is b, the number of choices for the third stage is c, etc., then the number of ways in which a ta