Equal Sums of Like Powers with Minimum Number of Terms

preprint2016arXivOpen access

Abstract

This paper is concerned with the diophantine system, ∑i=1s1xir=∑i=1s2yir, r=1, 2, …, k,\sum_{i=1}^{s_1} x_i^r=\sum_{i=1}^{s_2} y_i^r,\, r=1,\,2,\,\ldots,\,k, where s1s_1 and s2s_2 are integers such that the total number of terms on both sides, that is, s1+s2,s_1+s_2, is as small as possible. We define β(k)β(k) to be the minimum value of s1+s2s_1+s_2 for which there exists a nontrivial solution of this diophantine system. We find nontrivial integer solutions of this diophantine system when k<6k < 6, and thereby show that β(2)=4,   β(3)=6,   7≤β(4)≤8β(2) =4,\;\, β(3) = 6,\;\, 7 \leq β(4) \leq 8 and 8≤β(5)≤108 \leq β(5) \leq 10.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.