scientific article; zbMATH DE number 1076383
The paper discusses the problem of linearization of the diophantine equations \[ x_1^n+x_2^n+\cdots +x_{r_1}^n=y_1^n+y_2^n+ \cdots +y_{r_2}^n \tag{1} \] by introducing new variables, with the help of which assumed solutions of (1) can be parametrized. The paper demonstrates its versions of this parametrization for the equation \(x_1^n+x_2^n+x_3^n=y^n\) and the linearization procedure in the general case [see also \textit{N. Fleury} and \textit{M. Rausch de Traubenberg}, J. Math. Phys. 33, 3356-3366 (1992; Zbl 0772.15015)]. The paper's estimate for the smallest sum \(r(n)=r_1+r_2-1\) for solvable equations (1) is \(r(n) \leq 2n+1\). A better one \(r(n) < 2n-1\) has been obtained by \textit{L. Habsieger} [J. Number Theory 45, 92-111 (1993; Zbl 0779.11040)].
- On the simultaneous Diophantine equations \(m\cdot (x_1^k+x_2^k+\ldots+x_{t_1}^k)=n\cdot (y_1^k+y_2^k+\ldots+y_{t_2}^k)\), \(k=1,3\)
- Some diophantine problems concerning equal sums of integers and their cubes
- scientific article; zbMATH DE number 3743355
- scientific article; zbMATH DE number 3570557
- Some New Results on Equal Sums of Like Powers
- The Diophantine Equations of Second and Higher Degree of the Form 3xy = n (x + y) and 3xyz = n (xy + yz + zx) etc
- scientific article; zbMATH DE number 5142825 (Why is no real title available?)
- scientific article; zbMATH DE number 3619983 (Why is no real title available?)
- The Diophantine equation x(x+1)...(x+(m-1)) + r= yn
- An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k
- The Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359744)
