dc.contributor.advisor | 李陽明 | zh_TW |
dc.contributor.advisor | Chen, Young-Ming | en_US |
dc.contributor.author (Authors) | 黃大維 | zh_TW |
dc.contributor.author (Authors) | HUANG, TA-WEI | en_US |
dc.creator (作者) | 黃大維 | zh_TW |
dc.creator (作者) | HUANG, TA-WEI | en_US |
dc.date (日期) | 2020 | en_US |
dc.date.accessioned | 3-Aug-2020 17:58:35 (UTC+8) | - |
dc.date.available | 3-Aug-2020 17:58:35 (UTC+8) | - |
dc.date.issued (上傳時間) | 3-Aug-2020 17:58:35 (UTC+8) | - |
dc.identifier (Other Identifiers) | G0108751008 | en_US |
dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/131112 | - |
dc.description (描述) | 碩士 | zh_TW |
dc.description (描述) | 國立政治大學 | zh_TW |
dc.description (描述) | 應用數學系 | zh_TW |
dc.description (描述) | 108751008 | zh_TW |
dc.description.abstract (摘要) | 本篇論文的主旨是要證明兩個排列組合n*C(2r,(n+r-1))*C(r,2r)與C(r,n)*(n-r)*C(r,(n+r-1))是否相等,並嘗試找出這兩個排列組合之間的關係與意義。本篇論文提供兩個證明此組合等式n*C(2r,(n+r-1))*C(r,2r)=C(r,n)*(n-r)*C(r,(n+r-1))的方法,第一個方法簡潔快速,但是只能單純證明等式的相等,無法看出左式與右式的關係。第二個方法是將左式與右式分別建構成一個集合,並在兩個集合之間建構一個函數。此函數的特性為一對一(one to one)且映成(onto),也就是對射函數(bijection function),利用此方法完成第二個方法的證明。 | zh_TW |
dc.description.abstract (摘要) | The main topic in this paper is to prove the equality of these two expressions n*C(2r,(n+r-1))*C(r,2r)and C(r,n)*(n-r)*C(r,(n+r-1)).And attempt to find the relation between these two expressions and their meaning in combinatorics.In this paper, we provide two kinds of methods to solve the combinatorial identity n*C(2r,(n+r-1))*C(r,2r)=C(r,n)*(n-r)*C(r,(n+r-1)).The first way is simply proving the combinatorial identity by expansing the formula without knowing the meaning of the equation.The second method to solve the equation is constructing two sets consisting of the numbers of elements in n*C(2r,(n+r-1))*C(r,2r) and C(r,n)*(n-r)*C(r,(n+r-1)), respectively.And construct a bijective function to complete the second method of proof. | en_US |
dc.description.tableofcontents | 第一章 緒論.....................................11.1 前言........................................11.2 直觀證法....................................2第二章 等式敘述與論證............................32.1 等式意義....................................32.2 左式論證....................................33.2 證明........................................92.3 右式論證....................................6第三章 實證.....................................83.1 定義........................................83.2.1 一對一....................................93.2.2 映成......................................13第四章 結論與展望................................16參考文獻 ........................................18 | zh_TW |
dc.format.extent | 857198 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0108751008 | en_US |
dc.subject (關鍵詞) | 組合等式 | zh_TW |
dc.subject (關鍵詞) | 對射證明 | zh_TW |
dc.subject (關鍵詞) | 排列組合 | zh_TW |
dc.subject (關鍵詞) | Combinatorial identity | en_US |
dc.subject (關鍵詞) | Bijection proof | en_US |
dc.subject (關鍵詞) | Combinatorics | en_US |
dc.title (題名) | 關於一個組合等式的對射證明 | zh_TW |
dc.title (題名) | A Bijection Proof About a Combinatorial Identity | en_US |
dc.type (資料類型) | thesis | en_US |
dc.relation.reference (參考文獻) | [1] Alan Tucker(2012),Applied Combinatorics,sixth edition,John Wiley & Sons,Inc.,p.233.[2]C.L.Liu(2000),Introduction to Combinatorial Mathematics(International editions),McGraw-Hill.[3]Susanna S.Epp(2003),Discrete Mathematics with Applications,Cengage Learning[4]Peter J.Cameron(1994),Combinations:Topics,Techniques,Algorithms,London,Queen Mary&Westfield College.[5]劉麗珍(1994),一個組合等式的一對一證明,國立政治大學,應用數學碩士論文。[6]陳建霖(1996),一個組合等式的證明,國立政治大學,應用數學碩士論文。[7]韓淑惠(2011),開票一路領先的對射證明,國立政治大學,應用數學碩士論文。[8]薛麗姿(2013),一個珠狀排列的公式,國立政治大學,應用數學碩士論文。[9]黃永昌(2018),一個組合等式的對射證明,國立政治大學,應用數學碩士論文。 | zh_TW |
dc.identifier.doi (DOI) | 10.6814/NCCU202000717 | en_US |