您的位置:首页  > 论文页面

含连续数对的全排列计数问题研究

发表时间:2018-07-13  浏览量:209  下载量:58
全部作者: 张庆云,赵红涛
作者单位: 华北电力大学数理学院
摘 要: 运用不含连续数对的全排列计数结论及组合计数的一些基本原理,得到了恰含一个连续数对和恰含两个连续数对的全排列计数的结论。从而归纳出恰含l个连续数对的全排列计数的一般表达式,并结合算子,运用数学归纳法证明了该结论的正确性。
关 键 词: 组合数学;连续数组;连续数对;全排列
Title: Study on the counting problems of the permutation containing successive pairs
Author: ZHANG Qingyun, ZHAO Hongtao
Organization: School of Mathematics and Physics, North China Electric Power University
Abstract: Using the conclusion of the permutation counting excluding successive pairs and some fundamental combination counting principles, this paper finds the conclusion of the permutation counting formulas just containing one or two successive pairs. Furthermore, a general counting formula for permutations containing l successive pairs is obtained. And combining the operators, the correction of the above result is proved by the mathematical induction.
Key words: combinatorial mathematics; successive array; successive pairs; permutation
发表期数: 2018年7月第13期
引用格式: 张庆云,赵红涛. 含连续数对的全排列计数问题研究[J]. 中国科技论文在线精品论文,2018,11(13):1301-1305.
 
0 评论数 0
暂无评论
友情链接