| dc.contributor.advisor | 李陽明 | zh_TW |
| dc.contributor.author (Authors) | 邱明哲 | zh_TW |
| dc.contributor.author (Authors) | Chiu, Min-Che | en_US |
| dc.creator (作者) | 邱明哲 | zh_TW |
| dc.creator (作者) | Chiu, Min-Che | en_US |
| dc.date (日期) | 2000 | en_US |
| dc.date.accessioned | 18-Apr-2016 16:31:39 (UTC+8) | - |
| dc.date.available | 18-Apr-2016 16:31:39 (UTC+8) | - |
| dc.date.issued (上傳時間) | 18-Apr-2016 16:31:39 (UTC+8) | - |
| dc.identifier (Other Identifiers) | A2002001736 | en_US |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=95151 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 應用數學系 | zh_TW |
| dc.description (描述) | 87751012 | zh_TW |
| dc.description.abstract (摘要) | In this thesis, we use Mathematical Induction to give a direct proof to show the numbers of binary trees with nodes and nonnegative sequences with terms are the same. | en_US |
| dc.description.tableofcontents | 封面頁\r\n證明書\r\n論文摘要\r\n目錄\r\n1. Introduction\r\n1.1 Catalan number\r\n1.2 Nonnegative sequences with terms and its properties\r\n1.3 Sub-nonnegative sequences and its properties\r\n2. Function Definition\r\n2.1 Function construction\r\n2.2 Examples\r\n3. Proof\r\n3.1 The function is well-defined\r\n3.2 The function is injective\r\n3.3 The function is surjective\r\n3.4 Examples\r\nReference | zh_TW |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#A2002001736 | en_US |
| dc.subject (關鍵詞) | Combinatorics | en_US |
| dc.title (題名) | A Bijective Proof from Binary trees to Nonnegative sequences | en_US |
| dc.type (資料類型) | thesis | en_US |
| dc.relation.reference (參考文獻) | Reference\r\n[1] F. Roberts, Applied Combinatorics, Prentice-Hall, Englewood Cliffs, N.J., 1984.\r\n[2] John G. Michael and Kenneth H. Rosen, Applications Of Discrete Mathematics, McGraw-Hill, 1992.\r\n[3] K. Bogart, Introductory Combinatorics, Harcourt, Brace, Jovanovich, New York, 1990.\r\n[4] L. Comptet, Advanced Combinatorics, D. Reidel, Boston, 1974. | zh_TW |
