Cargando…
Integers representable as differences of linear recurrence sequences
Let [Formula: see text] and [Formula: see text] be two linear recurrence sequences. We establish an asymptotic formula for the number of integers c in the range [Formula: see text] which can be represented as differences [Formula: see text] . In particular, the density of such integers is 0.
Autores principales: | Tichy, Robert, Vukusic, Ingrid, Yang, Daodao, Ziegler, Volker |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8550782/ https://www.ncbi.nlm.nih.gov/pubmed/34723093 http://dx.doi.org/10.1007/s40993-021-00252-2 |
Ejemplares similares
-
Linear and integer programming /
por: Zionts, Stanley -
Representations of integers as sums of squares
por: Grosswald, Emil
Publicado: (1985) -
Representations for complex numbers with integer digits
por: Surer, Paul
Publicado: (2020) -
On prime powers in linear recurrence sequences
por: Odjoumani, Japhet, et al.
Publicado: (2021) -
Linear and integer optimization : theory and practice
por: Sierksma, Gerard, 1945-
Publicado: (2015)