The Pigeonhole Principle in Counting
碩士 === 逢甲大學 === 應用數學系 === 105 === We study the Pigeonhole Principle,which is a way of counting objects(enumeration) in the field ofdiscrete or combinational mathematics.It is,with so cute a name,basic,simple,interesting and yet having so many applications.The object is to present the principle in an...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/4wu69y |
| Summary: | 碩士 === 逢甲大學 === 應用數學系 === 105 === We study the Pigeonhole Principle,which is a way of counting objects(enumeration) in the field ofdiscrete or combinational mathematics.It is,with so cute a name,basic,simple,interesting and yet having so many applications.The object is to present the principle in an easy-to-understand way,collecting/categorizing various examples/questions to analyze different types of techniques for applying this principle,and to provide a suitable material for teaching high-school students.
|
|---|