On some generalizations of the diophantine equation $1^k + 2^k + ... + x^k = y^z$ (Q3960767)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 3783097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some generalizations of the diophantine equation $1^k + 2^k + ... + x^k = y^z$ |
scientific article; zbMATH DE number 3783097 |
Statements
On some generalizations of the diophantine equation $1^k + 2^k + ... + x^k = y^z$ (English)
0 references
1984
0 references
effective bound
0 references
exponential equation
0 references
0.8943383693695068
0 references
0.8723527193069458
0 references
0.8550125360488892
0 references
0.8501519560813904
0 references
0.8475838899612427
0 references
\textit{K. Györy}, \textit{R.Tijdeman} and \textit{M.Voorhoeve} [Acta Math. 143, 1--8 (1979; Zbl 0426.10019)] proved that for fixed \(R(x)\in \mathbb Z[x] = \mathbb A\), \(0\ne b\in \mathbb Z\) and fixed \(k >0\), \(k\notin \{1,3,5\}\) the equation \[ 1^k+2^k+\cdots +x^k + R(x) = by^z \tag{1} \] has only finitely many solutions in integers \(x,y, z > 1\). If \(R(x)\quad r \,(\in\mathbb Z)\) then their result is effective. We are concerned with the more general equation \[ F(S_k(x)) = by^z, \] where \(S_k(x) = 1^k+2^k+\cdots +x^k\) and \(F\in \mathbb A[y]\). Under certain conditions concerning the coefficients and the multiplicities of the zeros, respectively, of \(F\) we obtain effective bounds for all the solutions \(x, y, z\). As a special case we get an effective version of the above-quoted finiteness theorems concerning the equation (1).
0 references