| 相合问题的一个计算公式 |
| |
| 引用本文： | 郭绍建.相合问题的一个计算公式[J].北京航空航天大学学报,1989(1):129-134. |
| |
| 作者姓名： | 郭绍建 |
| |
| 摘 要： | 本文从古典概率的定义出发,利用简单的组合关系,导出n个配对中恰有k(0≤k≤n)个相合发生的概率计算公式。
|
| 关 键 词： | 相合问题 概率 组合 配对 |
A COMPUTING FORMULA OF THE COINCIDENCE PROBLEM |
| |
| Cuo Shaojian.A COMPUTING FORMULA OF THE COINCIDENCE PROBLEM[J].Journal of Beijing University of Aeronautics and Astronautics,1989(1):129-134. |
| |
| Authors: | Cuo Shaojian |
| |
| Institution: | Cuo Shaojian |
| |
| Abstract: | This topic started with the definition of the classical probability.By using simple relations of combinations it derived the computing formula of probability.in which n-matrhes having exactly k-coincidences are in appearance |
| |
| Keywords: | coincidence problem probability combination match |
| 本文献已被 CNKI 维普 等数据库收录！ |
