论文部分内容阅读
利用递推关系求解计数问题是处理排列组合问题的一种有效形式,我们可以从数字较简单的情形入手,逐步递推到一般的情形,其中建立递推关系是解题的关键所在,兹举几例说
The use of recursive relations to solve the counting problem is an effective way to deal with the problem of permutation and combination. We can start from the simpler case and gradually recursively to the general situation. The establishment of a recursive relationship is the key to solve problems. A few examples