Equal Sums of Like Powers with Minimum Number of Terms
Abstract
This paper is concerned with the diophantine system, Σi=1s1 xir=Σi=1s2 yir,\, r=1,\,2,\,…,\,k, where s1 and s2 are integers such that the total number of terms on both sides, that is, s1+s2, is as small as possible. We define β(k) to be the minimum value of s1+s2 for which there exists a nontrivial solution of this diophantine system. We find nontrivial integer solutions of this diophantine system when k < 6, and thereby show that β(2) =4,\;\, β(3) = 6,\;\, 7 ≤ β(4) ≤ 8 and 8 ≤ β(5) ≤ 10.
0