2000 character limit reached
Integers representable as differences of linear recurrence sequences
Published 3 Aug 2020 in math.NT | (2008.00844v1)
Abstract: Let ${U_n}{n \geq 0}$ and ${V_m}{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In particular, the density of such integers is $0$.
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.
