摘要
本文通过建立对称的对应关系 ,并利用帮助互开对 ,使 5880把锁形成 2 94 0个互开对 ,从而彻底解决了 1 994年全国大学生数学建模竞赛 B题中的遗留问题 .
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.
出处
《数学的实践与认识》
CSCD
2000年第4期459-466,共8页
Mathematics in Practice and Theory
关键词
帮助互开对
最大不互开锁数
锁具装箱问题
数学模型
corresponding
helping opening mutually couple
the maximal number of non opening mutually locks
