弗洛伊登塔尔不可能之谜的机械化算法  

A Mechanization of the Impossible Puzzle Raised by Hans Freudenthal from Intelligent Agents Point of View

作　　者：曾振柄[1] 黄勇[2] ZENG Zhenbing;HUANG Yong(Department of Mathematics, Shanghai University, Shanghai 200444;Research Institute of Computation Science and Technology, Guangzhou University, Guangzhou 510006)

机构地区：[1]上海大学数学系,上海200444 [2]广州大学计算科技研究院,广州510006

出　　处：《系统科学与数学》2018年第12期1477-1496,共20页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金(11471209;11701118);黔科合平台人才(2016)5609项目;黔学位合字ZDXK(2016)20号项目资助课题

摘　　要：1969年荷兰数学家汉斯·弗洛伊登塔尔提出的"和与积之谜",涉及到整数分拆和因子分解的基本性质,这个表述非常简单的问题表面上看是一个不可能解决的谜题.文章从自动推理智能体的视角,用浅显而严格的语言解释弗洛伊登塔尔问题的求解过程,可作为计算机搜索程序的设计参照.文章从弗洛伊登塔尔问题延伸定义了弗洛伊登塔尔数(Freudenthal numbers, F数)序列,通过计算机数学实验探讨了F数序列的性质,提出了几个有趣的未解决问题.This article presents a rigorous and step-by-step explanation to the automated reasoning procedure of the famous Impossible Puzzle(the Puzzle of Sum and Products) raised by Hans Freudenthal from the point of view of intelligent agents. The discussion provides an example of automated reasoning and searching of multi-agents in artificial intelligence. The original puzzle has also been extended to generating the Freudenthal numbers and several other sequences integers existed in the The On-Line Encyclopedia of Integer Sequences. Several interesting unsolved problems related to Freudenthal numbers are given in the last section for further investigation.

关 键 词：和与积之谜 因子分解 整数分拆 智能体 弗洛伊登塔尔数 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]