Sums of Factorials in Binary Recurrence
β
George Grossman; Florian Luca
π
Article
π
2002
π
Elsevier Science
π
English
β 141 KB
In this paper, we consider the problem of expressing a term of a given nondegenerate binary recurrence sequence as a sum of factorials. We show that if one bounds the number of factorials allowed, then there are only finitely many effectively computable terms which can be represented in this way. As