| 引用本文： |
-
梁文忠,陈红,许成章,罗海鹏.分糖函数g(4m,5)初探[J].广西科学,2009,16(3):230-233. [点击复制]
- LIANG Wen-zhong,CHEN Hong,XU Cheng-zhang,LUO Hai-peng.Initially Probing into Candy Sharing Function g(4m,5)[J].Guangxi Sciences,2009,16(3):230-233. [点击复制]
|
|
| 摘要: |
| 研究由分糖游戏引出的一道组合数学难题——分糖函数g(4m,5)的定量计算.给出该函数一种新的计算方法,并通过计算机得出4 ≤ 4m ≤ 80时分糖函数的准确值及所有相应的优秀向量. |
| 关键词: 组合数学 分糖函数 优秀向量 算法 |
| DOI： |
| 投稿时间：2008-07-20 |
| 基金项目:国家自然科学基金项目(60563008);广西自然科学基金项目(0991278);梧州学院科研项目资助 |
|
| Initially Probing into Candy Sharing Function g(4m,5) |
|
LIANG Wen-zhong1, CHEN Hong1, XU Cheng-zhang1, LUO Hai-peng2
|
| (1.Wuzhou University, Wuzhou, Guangxi, 543002, China;2.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China) |
| Abstract: |
| A difficult problem of combinatorics caused by candy sharing game——quantitative calculation of candy sharing function g(4m,5) is studied, a new arithmetic is given, and precise values of the candy sharing function g(4m,5) in 4 ≤ 4m ≤ 80 and all of the corresponding excellent vectors are obtained by computer. |
| Key words: combinatorics candy sharing function excellent vector arithmetic |
