On the Diophantine equation F(x)=G(y)

DOI10.4064/aa110-2-8zbMath1043.11030OpenAlexW1995965285MaRDI QIDQ4429654

Szabolcs Tengely

Publication date: 28 September 2003

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa110-2-8

zbMATH Keywords

upper boundspolynomial Diophantine equationmonic polynomials with integer coefficients

Mathematics Subject Classification ID

Cubic and quartic Diophantine equations (11D25) Higher degree equations; Fermat's equation (11D41)

Related Items

Power values of sums of certain products of consecutive integers and related results ⋮ Practical solution of the Diophantine equation \(X^{nr}+Y^n = q\) ⋮ On the Diophantine equation \(\prod_{i \leq m}(d_iy + q_i) = f(x)\) ⋮ On a problem of Erdős and Graham ⋮ The diophantine equation \((y+q_1)(y+q_2) \cdots (y+q_m) = f(x)\) ⋮ ESTIMATES FOR THE SOLUTIONS OF CERTAIN DIOPHANTINE EQUATIONS BY RUNGE'S METHOD ⋮ An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition ⋮ Combinatorial numbers in binary recurrences ⋮ On the Diophantine equation \(F(\binom{x}{n})=b\binom{y}{m}\) ⋮ An Elementary Algorithm for Solving a Diophantine Equation of Degree Fourth with Runge’s Condition