Sums of Factorials in Binary Recurrence Sequences
β Scribed by George Grossman; Florian Luca
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 141 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 an application, we also find the largest members of the classical Fibonacci and Lucas sequences which can be written as a sum or a difference of two factorials.
π SIMILAR VOLUMES
In recent work by Hajdu and Szalay, Diophantine equations of the form Γ°a k Γ 1ΓΓ°b k Γ 1Γ ΒΌ x 2 were completely solved for a few pairs Γ°a; bΓ: In this paper, a general finiteness theorem for equations of the form u k v k ΒΌ x n is proved, where u k and v k are terms in certain types of binary recurren
We consider non-degenerate binary recurring sequences with positive discriminant, relatively prime parameters, and whose initial terms satisfy a certain divisibility condition. Assuming that the ABC conjecture is true, we show that the powerful part of the terms of the sequence remain ``small.'' In
The MASBR (maximum sum of binary-coded residuals) procedure proposed previously as a robust regression method has been modified and applied to find the linear substructures in a data set. A graphic approach is used to identify the acceptable error limit (AEL) in the MASBR algorithm. Some data sets w
## Abstract Electroencephalography (EEG) signals have been an attractive choice to build noninvasive brain computer interfaces (BCIs) for nearly three decades. Depending on the stimuli, there are different responses which one could get from EEG signals. One of them is the P300 response which is a v