自然数196的回文数猜想检验的新算法  

New arithmetic for verification of supposition palindrome number 196

作　　者：孔令德[1] 刘杰[1] 

机构地区：[1]中北大学分校,山西太原030008

出　　处：《计算机工程与设计》2007年第24期5841-5843,5853,共4页Computer Engineering and Design

摘　　要：回文数的猜想是一个著名的数学命题,尤其是特殊的自然数196的回文数,到目前为止尚未得到证实。在字长为32位的计算机上,如果使用整型变量进行处理,最多能检验到17步,使用整型数组的计算量也不过上万步。为了继续检验,提出了用字符数组存储原数、新数和逆序数的新算法,突破了WindowsXP 32位字长的限制,可以达到上千万步的运算量。The supposition of palindrome number is a famous mathematical proposition, especially to particular palindrome number of natural number 196, that still have not been proved. On the 32 bit word length computer, if deal with integer variable, the maximum amout of calculation can only be proceeded within 17 steps. Even using integer array to deal with the palindrome number of 196, the amout of calculation is limited ten thousands steps. To keep on testing, a new algorithm is put forward. Character array is used to store original number, new number and reverse number. By using this new algorithm, computer can calculate to amout of thousand thousands steps by breaking the limit of WindowsXP word length.

关 键 词：回文数 猜想 算法 字符数组 检验 

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