2000 character limit reached
On a variant of Pillai's problem II
Published 20 Oct 2016 in math.NT | (1610.06304v2)
Abstract: In this paper, we show that there are only finitely many $c$ such that the equation $U_n - V_m = c$ has at least two distinct solutions $(n,m)$, where ${U_n}{n\geq 0}$ and ${V_m}{m\geq 0}$ are given linear recurrence sequences.
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.