| 几种有限可重组合的公式型解法 |
| |
| 引用本文： | 张竞.几种有限可重组合的公式型解法[J].航空计算技术,2001,31(3):16-18. |
| |
| 作者姓名： | 张竞 |
| |
| 作者单位： | 咸阳师范学院,陕西咸阳,712000 |
| |
| 摘 要： | 对于有限可重组合问题 ,通常用母函数方法1] 作解答 ,但当数据比较大时 ,母函数方法就不太方便。更重要的是 ,母函数方法很难在计算机中实现。本文对几种有限可重组合问题给出了公式型解法
|
| 关 键 词： | 可重数 可重数为K的有限可重组合 可重数为2的有限可重组合数 |
| 修稿时间： | 2001年5月10日 |
A Formulistic Method for Several Finite Duplicatable Combinations |
| |
| ZHANG Jing.A Formulistic Method for Several Finite Duplicatable Combinations[J].Aeronautical Computer Technique,2001,31(3):16-18. |
| |
| Authors: | ZHANG Jing |
| |
| Abstract: | To solve the finite duplicatable combination, the general method is using generating function. But when it comes to a large scale,using generating function is not convenient enough. Especially, it is very difficult for generating function to be realized in computer. This thesis gives a few formulistic methods for several finite duplicatable combinations. |
| |
| Keywords: | multiplicity finite k-duplicatable combination finite 2-duplicatable combination |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
