摘要
利用母函数及摸球模型,证明了从n个不同数中取出k个数且上限距分别为m1,m2,...,m(k-1)
Using generating function and a model of balls-fetching,I proved the combinationnumber formula A (n, k, m1, m2, ..', mk-1 ) in which different knumbers are taken out from different n numbers, and the upper bound is m1,m2, ...,mk-1 sep-arately,
出处
《黄冈师范学院学报》
1999年第6期4-6,共3页
Journal of Huanggang Normal University
关键词
母函数
上限距
摸球模型
组合数公式
bound combination
generating function
1-1 correspondence