引用CydeWeys · 2018-09
“For those wondering, this works in every base ≥ 5, according to the original paper: Every positive integer is a sum of three palindromes”
指出原论文说明该结论在每个 5 及以上的进制都成立
证明在 g 进制(g≥5)下任何正整数都能写成三个回文数之和
论文证明:对于任意整数 g≥5,每个正整数在 g 进制下都可以写成三个回文数之和。评论中提到论文还有较长的算法与正确性证明部分,并在开头附近讨论了 2 进制下需要更多加数的情形。
HN 评论者主要是在回应一则相关的数学趣闻,指出原论文说明结论对所有 5 进制以上都成立,并有完整的算法与证明。
“For those wondering, this works in every base ≥ 5, according to the original paper: Every positive integer is a sum of three palindromes”
“This is discussed in the original paper at the bottom of the second page: Every positive integer is a sum of three palindromes”
“Well, there is a whole 40+ page paper on the algorithm and its proof of correctness. So, yes there is an answer. Every positive integer is a sum of three palindromes”
“Quite miraculous.”