鸽巢原理 容斥原理_第1页
鸽巢原理 容斥原理_第2页
鸽巢原理 容斥原理_第3页
鸽巢原理 容斥原理_第4页
鸽巢原理 容斥原理_第5页
已阅读5页,还剩14页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、2006级2008. 11. 9鸽巢原理与容斥原理1Contents鸽巢原理:简单形式鸽巢原理:加强形式容斥原理2Pigeonhole PrincipleIf 7 pigeons are to live in 6 boxes (holes), then there is at least one box containing two or more pigeons.3Dirichlet (狄里克雷)“鸽巢原理”,最先是由19世纪的德国数学家狄里克雷应用于解决问题,后人们为了纪念他从这么平凡的事情中发现的规律,就把这个规律用他的名字命名,叫“狄里克雷原理”,又把它叫做“抽屉原理”。4Pigeon

2、hole Principle If we put n+1 balls into n boxes, then at least one box must contain two or more balls. 将n+1个球放入n个盒子内, 最小有一个盒子藏有2个或以上的球。5ProofWe want to prove that at least one box must contain two or more balls.反证法Assume that the statement above is wrong then all the n boxes contains 1 or 0 ball. Th

3、erefore the total number of balls is less than or equal to n. This is a contradiction (矛盾). The contradiction is due to our assumption that the statement is wrong.We conclude that the statement must be true.6Examples For any 368 people, at least two of them must have the same birthday.There are at l

4、east two people in the world having same number of hair. At least two of you in this class (assuming the class size 12) born in the same month. 7Exercise There are 10 married couples. How many of the 20 people must be selected in order to guarantee that one has selected a married couple ?Answer: 118

5、Pigeonhole Principle : Strong Form (鸽巢原理加强形式)If we put (k*n+1) balls in n boxes, then at least one box must contain k+1 or more balls.将 (k*n+1) 个球放入n个盒子內, 最小有一个盒子藏有k+1个或以上的球。9ProofWe want to prove that at least one box must contain k+1 or more balls.Assume that the statement above is wrong then all

6、the n boxes contains k or less balls. Therefore the total number of balls is less than or equal to n*k. This is a contradiction (矛盾). The contradiction is due to the assumption that the statement is wrong.We conclude that the statement must be true.10Exercise There are 90 people in a hall. Some of t

7、hem know each other, some are not. Prove that there are at least two persons in the hall who know the same number of people in the hall.What should be the holes and pigeons? How many holes are there?11Solution If there is a person in the hall who does not know any other people, then each of the othe

8、r persons in the hall may know either 0, or 1, or 2, or 3, . , or 88 people. Therefore we have 89 holes numbered 0, 1, 2, 3, . , 88, and have to distribute among 90 people.Next, assume that every person in the hall know at least one other person. Again, we have 89 holes 1, 2, 3, . , 89 and 90 people

9、.In either case, we can apply the Pigeonhole Principle to get the conclusion.12Pigeonhole Principle : Strong Form (鸽巢原理加强形式)令q1, q2, , qn为正整数。 如果将 q1 + q2 + qn n + 1个物体放入n个盒子内,那么, 或者第一个盒子至少含有q1个物体,或者第二个盒子至少含有q2个物体,, 或者第n个盒子至少含有qn个物体。13Pigeonhole Principle : Strong Form (鸽巢原理加强形式)证明:(反证法)设将q1 + q2 + qn n + 1个物体分到n个盒子中。 如果对于每个i=1, 2, , n, 第i个盒子含有少于qi个物体, 那么所有盒子中的物体总数不超过(q1-1) + (q2-1) + (qn-1) = q1 + q2 + qn n该数比所分发的物体总数少1, 因此我们断言, 对于某一个i=1, 2, , n, 第i个盒子至少包含 qi个物体。14Pigeonhole Principle : Strong Form (鸽巢原理加强形式)将m个物体放入n个盒子内

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

最新文档

评论

0/150

提交评论