| 锁具装箱问题的最大不互开锁数的理论证明 |
| |
| 引用本文： | 闵孟斌.锁具装箱问题的最大不互开锁数的理论证明[J].数学的实践与认识,2000,30(4). |
| |
| 作者姓名： | 闵孟斌 |
| |
| 作者单位： | 江苏宿迁师范专科学校,宿迁,223800 |
| |
| 摘 要： | 本文通过建立对称的对应关系 ,并利用帮助互开对 ,使 5880把锁形成 2 94 0个互开对 ,从而彻底解决了 1 994年全国大学生数学建模竞赛 B题中的遗留问题 .
|
| 关 键 词： | 对应 帮助互开对 最大不互开锁数 |
The Theoretical Proof on the Maximal Number of Non-Opening-Mutually Locks |
| |
| MIN Meng-bin.The Theoretical Proof on the Maximal Number of Non-Opening-Mutually Locks[J].Mathematics in Practice and Theory,2000,30(4). |
| |
| Authors: | MIN Meng-bin |
| |
| Abstract: | This article at first establishes the symmetrical corresponding relationships among the locks, and then uses the helping opening mutually couple to make 5880 locks form 2940 opening mutually couples, at last proves the maximal number of non opening mutually locks is 2940. Therefore, the unsolved problem in CMCM 1994 is solved completely. |
| |
| Keywords: | corresponding helping opening mutually couple the maximal number of non opening mutually locks |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
