Pairs of additive congruences to a large prime modulus (Q677633): Difference between revisions

Let \(n\), \(k\) be integers with \(k\geq 2\) and \(n>4k\). With the help of the Hasse-Weil sum estimate for multiplicative characters, the author is able to improve upon the previous known result due to \textit{O. D. Atkinson, J. Brüdern} and \textit{R. J. Cook} [Mathematika 39, 1-9 (1992; Zbl 0774.11016)] on the \(p\)-adic solutions of the system of equations \[ \begin{aligned} a_1x^k_1+\cdots+a_nx^k_n=0\\ b_1x^k_1+\cdots + b_nx^k_n=0,\end{aligned} \] where \(a_j\) and \(b_j\) are integers. He proves that the above system has a nontrivial \(p\)-adic solution for all \(p>3k^4\). In [ibid] they required \(p>k^6\).