Consider the title equation, where r,s,b, and k are given nonzero integers \((k>0)\). In this paper new conditions on r,s, and k are established under which the equation has only finitely many solutions in integers \(x>0\), y with \(| y| \geq 2\) and \(z\geq 2\). These conditions can all be stated in terms of divisibility properties of the integer constants r,s, and k by powers of 2. The finiteness argument is provided by results of \textit{K. Györy}, \textit{R. Tijdeman} and \textit{M. Voorhoeve} [Acta Arith. 37, 233-240 (1980; Zbl 0365.10014)].
- On some generalizations of the diophantine equation 1ᵏ + 2ᵏ + ... + x^k = y^z
- On the number of solutions of the equation \(1^k+2^k+\dots+(x-1)^k=y^z\)
- On some generalizations of the Diophantine equation \(s(1^{k}+2^{k}+\cdots +x^{k})+r=dy^{n}\)
- scientific article; zbMATH DE number 1992399
- On the equation f(1)1ᵏ + f(2)2ᵏ + ... + f(x)x^k + R(x)= by^z
- A note on the equation 1^ k+2^ k++(x-1)^ k=y^ m
- The degree of regularity of the equation \(\sum_{i=1}^nx_i=\sum_{i=1}^ny_i+b\)
- On some generalizations of the Diophantine equation \(s(1^{k}+2^{k}+\cdots +x^{k})+r=dy^{n}\)
- On the equation f(1)1ᵏ + f(2)2ᵏ + ... + f(x)x^k + R(x)= by^z
- On some generalizations of the diophantine equation 1ᵏ + 2ᵏ + ... + x^k = y^z
- ON THE EQUATION x(x+d)…(x+(k-1)d)=by 2
- Power values of power sums: a survey
This page was built for publication: On the equation \(s(1^ k+2^ k+\cdot \cdot \cdot +x^ k)+r=by^ z\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641328)
