On the generalized Pillai equation a^x b^y=c
From MaRDI portal
Publication:852536
Abstract: In this paper we consider , the number of solutions to the equation in nonnegative integers and integers , for given integers , , , and . We show that when and , except for a finite number of cases that can be found in a finite number of steps. For arbitrary and , we show that when we have , with an infinite number of cases for which N=3.
Recommendations
- The generalized Pillai equation \(\pm ra^x\pm sb^y=c\)
- On Pillai's Diophantine equation
- The number of solutions to the generalized Pillai equation \(\pm ra^{x} \pm sb^{y}=c\).
- On some exponential equations of S. S. Pillai
- Handling a large bound for a problem on the generalized Pillai equation \(\pm r a^{x} \pm sb^{y}=c\)
Cites work
- scientific article; zbMATH DE number 3823895 (Why is no real title available?)
- scientific article; zbMATH DE number 3544117 (Why is no real title available?)
- scientific article; zbMATH DE number 3544118 (Why is no real title available?)
- scientific article; zbMATH DE number 3106494 (Why is no real title available?)
- A class number free criterion for Catalan's conjecture.
- A conjecture concerning the exponential diophantine equation ax+by=cz
- A corollary to a theorem of Laurent-Mignotte-Nesterenko
- Applications of the hypergeometric method to the generalized Ramanujan-Nagell equation
- Catalan’s Conjecture: Another old Diophantine problem solved
- Diophantine equations related to finite groups
- Exponential diophantine equations
- Exponential diophantine equations with four terms
- New Solutions of a p - 1 ≡1 (mod p 2 )
- On \(p^x-q^y=c\) and related three term exponential Diophantine equations with prime bases.
- On some exponential equations of S. S. Pillai
- On the Equation a x - b y = 1
- On the Equation a x - b y = 1
- On the equations \(p^x - b^y = c\) and \(a^x + b^y = c^z\)
- On the generalized Ramanujan-Nagell equation I
- Pillai's conjecture revisited.
- Small Two-Variable Exponential Diophantine Equations
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Sur une classe d'équations exponentielles
- The Diophantine Equation x 2 = 4q n + 4q m + 1
- The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory
- The equations 2N 2M 2L=z^2
Cited in
(14)- Multiplicative dependence of the translations of algebraic numbers
- Bennett's Pillai theorem with fractional bases and negative exponents allowed
- The generalized Pillai equation \(\pm ra^x\pm sb^y=c\)
- Pillai's conjecture revisited.
- On \(p^x-q^y=c\) and related three term exponential Diophantine equations with prime bases.
- The number of solutions to the generalized Pillai equation \(\pm ra^{x} \pm sb^{y}=c\).
- On Pillai's problem with X-coordinates of Pell equations and powers of 2
- On Pillai’s problem with X-coordinates of Pell equations and powers of 2 II
- Pillai's equation in polynomials
- Handling a large bound for a problem on the generalized Pillai equation \(\pm r a^{x} \pm sb^{y}=c\)
- A note on the number of solutions of the Pillai type equation \(| a^x - b^y | = k\)
- Number of solutions to \(ka^x+lb^y=c^z\)
- At most one solution to \(a^x + b^y = c^z\) of \(a, b, c\)
- On a conjecture concerning the number of solutions to \(a^x + b^y = c^z\). II
This page was built for publication: On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852536)