Pillai's equation in polynomials
Let \(a,b\) and \(c\) be fixed non-zero integers. Then the equation \[ a^x - b^y = c \] in positive integers \(x, y \in \mathbb{N}\) is called Pillai's Diophantine equation and it receives much attention, there are many papers in the literature about this problem. In the paper under review, the author considers that equation in polynomials. More precisely, suppose that \(A, B\) and \(C\) are some nonconstant polynomials of \(K[t]\), then it is shown that the equation \[ A(t)^x + B(t)^y = C(t) \] has at most one solution in positive integers \(x, y\) except three special cases described in the paper. In those exceptional cases, the equation has exactly two solutions \((x, y) \in \mathbb{N}^2\). Proof of the main result is based on a series of lemmas obtained from some calculations through the algebraic number theory tools.
- A note on Jeśmanowicz' conjecture
- A survey on the ternary purely exponential Diophantine equation $a^x+b^y=c^z$
- An alternate proof of Mason's theorem
- scientific article; zbMATH DE number 3124071 (Why is no real title available?)
- scientific article; zbMATH DE number 3000755 (Why is no real title available?)
- On a problem of Pillai with \(k\)-generalized Fibonacci numbers and powers of 2
- On a variant of Pillai's problem. II.
- On Pillai's Diophantine equation
- On Pillai's problem with X-coordinates of Pell equations and powers of 2
- On some exponential equations of S. S. Pillai
- On the problem of Pillai with Padovan numbers and powers of 3
- The number of solutions to the generalized Pillai equation \(\pm ra^{x} \pm sb^{y}=c\).
This page was built for publication: Pillai's equation in polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657261)
