On the Diophantine equation F(x)=G(y)
From MaRDI portal
Publication:4429654
DOI10.4064/aa110-2-8zbMath1043.11030MaRDI QIDQ4429654
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
Related Items
On a problem of Erdős and Graham, An Elementary Algorithm for Solving a Diophantine Equation of Degree Fourth with Runge’s Condition, The diophantine equation \((y+q_1)(y+q_2) \cdots (y+q_m) = f(x)\), Practical solution of the Diophantine equation \(X^{nr}+Y^n = q\), Combinatorial numbers in binary recurrences, Power values of sums of certain products of consecutive integers and related results, On the Diophantine equation \(\prod_{i \leq m}(d_iy + q_i) = f(x)\), An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition, On the Diophantine equation \(F(\binom{x}{n})=b\binom{y}{m}\), ESTIMATES FOR THE SOLUTIONS OF CERTAIN DIOPHANTINE EQUATIONS BY RUNGE'S METHOD