2000 character limit reached
Pillai's conjecture for polynomials
Published 26 Jan 2022 in math.NT | (2201.10964v1)
Abstract: In this paper we study the polynomial version of Pillai's conjecture on the exponential Diophantine equation \begin{equation*} pn - qm = f. \end{equation*} We prove that for any non-constant polynomial $ f $ there are only finitely many vectors $ (n,m,\mathrm{deg}\ p,\mathrm{deg}\ q) $ with integers $ n,m \geq 2 $ and non-constant polynomials $ p,q $ such that Pillai's equation holds. Moreover, we will give some examples that there can still be infinitely many possibilities for the polynomials $ p,q $.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.