A survey of equal sums of like powers
A survey of equal sums of like powers
复制标题
相似权力等和的调查
DOI：
--
复制
发表时间：
1967
期刊：
影响因子：
--
通讯作者：
J. Selfridge
中科院分区：
文献类型：
--
作者：
L. J. Lander;T. R. Parkin;J. Selfridge
已经被许多数学家用各种方法研究了很多年[1]，b[2]。我们最近使用CDC 6600进行了一系列的计算机搜索，以确定存在解的参数k， m， n的集合，并找到某些集合的最小解。本文概述了计算的结果，注意到一些先前发表的结果，并以一个表结束，表中显示了对于k和m的不同值，(1)的解已知的最小n。我们将注意力限制在fc < 10。我们假设Xi和y都是正整数，x的y次方。我们不区分不同的解，不同的解只在于原子的重新排列。我们将(1)称为（fc）。M. n)并说（fc. n）的原始解。m.n)是一个没有整数> 1能整除所有数字xi， xi，••••，xm, yi, ？/2，••••把
has been studied by numerous mathematicians for many years and by various methods [1], [2]. We recently conducted a series of computer searches using the CDC 6600 to identify the sets of parameters k, m, n for which solutions exist and to find the least solutions for certain sets. This paper outlines the results of the computation, notes some previously published results, and concludes with a table showing, for various values of k and m, the least n for which a solution to (1) is known. We restrict our attention to fc < 10. We assume that the Xi and y¡ are positive integers and x, ^ y¡. We do not distinguish between solutions which differ only in that the aor y¡ are rearranged. We will refer to (1) as (fc. m. n) and say that a primitive solution to (fc. m. n) is one in which no integer > 1 divides all the numbers xi, Xi, • • •, xm, yi, ?/2, • • •, yn. Putting