Integers representable as differences of linear recurrence sequences

Abstract

Let \Un\n ≥slant 0 and \Gm\m ≥slant 0 be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers c in the range [-x, x] which can be represented as differences Un - Gm, when x goes to infinity. In particular, the density of such integers is 0.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…