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
Sections and Lacunary Sums of Linearly Recurrent Sequences
β Scribed by Luis Verde-Star
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 132 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A set E of integers is called a B h [ g] set if every integer can be written in at most g different ways as a sum of h elements of E. We give an upper bound for the size of a B h [1] subset [n 1 , ..., n k ] of [1, ..., n] whenever h=2m is an even integer: For the case h=2 (h=4) this has already be
A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.
## Abstract __MLL__ gene rearrangements leading to production of MLL fusion proteins are commonly detected in infant leukemia patients; the most common __MLL__ fusion associated with infant leukemia is the __MLLβAF4__ fusion. A single case of chromosomal rearrangement leading to production of an __