Practical solution of the Diophantine equation X^nr+Y^n = q
The author studies the Diophantine equation \[ X^{nr} + Y^n = q \] for positive integers \(n,r,q\) with \(n \geq 3\) odd. He proves the estimate \(|x| \leq |q|^{1/r}\) for the integer solutions \((x,y)\) of the above equation. This estimate is an immediate consequence of Theorem 1.1 of the paper which states that if \((x,y)\) is an integer solution to the equation \(X^n + Y^n = q\), then \(|x| \leq |q|\). As an application, it is proven that, for \(r\) fixed, the exponential Diophantine equation \(X^{yr} - Y^y = 1\) admits no nontrivial integer solution \((X,Y,y)\) with \(y \geq 2\) and \(X,Y > 0\). The proofs are based on the binomial theorem and some elementary properties of the gamma function. The author also provides an algorithm for the solution of the equation \(X^{nr} + Y^n = q\), and illustrates it by some examples.
- THE EXPONENTIAL DIOPHANTINE EQUATION nx + (n + 1)y = (n + 2)z REVISITED
- ON THE DIOPHANTINE EQUATION
- On the Diophantine equation \(x^2 + 2^{\alpha} 5^{\beta} 17^{\gamma} = y^n\)
- The Diophantine equation a^x+(a+1)^y = z^2
- A refined modular approach to the Diophantine equation \(x^{2} + y^{2n} = z^{3}\)
- Catalan’s Conjecture: Another old Diophantine problem solved
- Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
- scientific article; zbMATH DE number 426341 (Why is no real title available?)
- scientific article; zbMATH DE number 3465378 (Why is no real title available?)
- On Gamma Function Inequalities
- On the Diophantine equation F(x)=G(y)
- On the Equation a x - b y = 1
- Primary cyclotomic units and a proof of Catalans conjecture
- Sur le théorème de Runge
This page was built for publication: Practical solution of the Diophantine equation \(X^{nr}+Y^n = q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633470)
