Integers representable as differences of linear recurrence sequences
Abstract
Let \Un\n ≥ 0 and \Vm\m ≥ 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 Un - Vm. In particular, the density of such integers is 0.
0