The Tarry-Escott problem of degree two (Q2392047): Difference between revisions

The Tarry-Escott problem asks for two different multisets of integers \(\{a_1,\dots,a_n\}\) and \(\{b_1,\dots,b_n\}\) such that for a positive integer \(k\) we have \(\sum_{i=1}^n a_i^j=\sum_{i=1}^n b^j\) for every \(1\leq j\leq k\). Here \(n\) is the size and \(k\) is the degree of the problem. The author completely describes the so-called optimum reduced solutions of degree two, over the ring of Gaussian integers and over polynomial rings over finite fields.