论文部分内容阅读
排列组合属于数学中相对独立的一门分支学科,它研究的核心问题是在给定条件下的某事件可能出现的情况总数。排列组合既是学习概率论与数理统计的理论基础,又是组合数学中最基本的概念。由于排列组合问题千变万化,解法灵活,条件隐晦,思想抽象,难以找到解题的突破口。因而在求解排列组合应用题时,除了做到排列组合分清,加法乘法原理辩明外,还应注意避免重复或遗漏。在排列组合问题中,除了最直观的捆绑法和插空法外,还有
Permutations and combinations belong to a relatively independent branch of mathematics, the core of which is to study the total number of situations in which an event may occur under a given condition. Permutation and combination is not only the theoretical basis of learning probability theory and mathematical statistics, but also the most basic concept in combinatorial mathematics. Due to the ever-changing array of combinations, flexible solution, the conditions are obscure, abstract thinking, it is difficult to find a breakthrough in solving problems. Therefore, in the solution to the combination of application questions, in addition to do the arrangement and combination of clear, addition and multiplication principle to clarify, but also should be taken to avoid duplication or omission. In the arrangement of combination problems, in addition to the most intuitive bundling and plug-in law, there