A Bijective Proof of a Combinatorial Identity
碩士 === 國立政治大學 === 應用數學系 === 106 === The purpose of studying combinatory mathematics is not only to calculate the answer, but to understand the process of calculating the answer. In this paper, this study attempts to use the combined method to prove the following equation: C(r,n)*(n-r)*C(r,(n+r-1)...
Main Authors: | Huang, Young-Chang, 黃永昌 |
---|---|
Other Authors: | Chen, Yong-Ming |
Format: | Others |
Language: | zh-TW |
Published: |
2018
|
Online Access: | http://ndltd.ncl.edu.tw/handle/39f49r |
Similar Items
-
A Bijective Proof of a Combinatorial
by: Liu Li-Jean, et al.
Published: (1994) -
A Bijective Proof of a Binomial Identity
by: Lo, Fu Chiao, et al.
Published: (2009) -
A Bijective Proof of Derangements
by: Tsong-Yu Horng, et al.
Published: (1994) -
A bijective proof of derangements
by: Hong, Cong Yu, et al.
Published: (1994) -
A Bijective Proof of Catalan Number
by: Lee, Ing-Jye, et al.
Published: (1996)