| 一个重集排列问题 |
| |
| 引用本文： | 吴效显.一个重集排列问题[J].菏泽学院学报,1997(4). |
| |
| 作者姓名： | 吴效显 |
| |
| 作者单位： | 菏泽师专 山东菏泽274015 |
| |
| 摘 要： | 对于(1+t+t~2/2!+t~3/3!)~n的展开式系数,目前仍没有一个公式表示,本文用组合的观点,推导其通项公式,有限重的重集排列问题,并不能用(1+t+t~2/2!+…)~n=e~(tn)来解决。大多数组合数学文献,只涉及无限重的重集排列问题,因此,应正视有限重的重集排列问题。
|
| 关 键 词： | 重集排列 主色球 中色球 辅色球 中辅方程组 |
A Problem of Permutation With Repetition |
| |
| Wu Xiaoxian.A Problem of Permutation With Repetition[J].Journal of Heze University,1997(4). |
| |
| Authors: | Wu Xiaoxian |
| |
| Abstract: | For the expansion coefficients of ( )n there is no representation formula so far. In this paper, we reduce the general term's formula with combination viewpoint. Problems ofpermutation with finite repetition can not be solved by ( )m = etn. Most combinationdocuments involve only problems of permutation infinite repetition, but I thina that we should face up to permutation with finite repetition. Therefore, I write this paper to cast a brick to attract jade. |
| |
| Keywords: | permutation with repetition the ball with main colour the ball with secondary colour the ball with supplementary colour s s equations |
| 本文献已被 CNKI 等数据库收录！ |
|
