Some remarks about Fibonacci multiplication (Q922580): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Import recommendations run Q6534273
 
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter Hagis jun. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0893-9659(89)90078-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047242165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci multiplication / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Fibonacci multiplication / rank
 
Normal rank
Property / Recommended article: Fibonacci multiplication / qualifier
 
Similarity Score: 0.920295
Amount0.920295
Unit1
Property / Recommended article: Fibonacci multiplication / qualifier
 
Property / Recommended article
 
Property / Recommended article: Associativity of recurrence multiplication / rank
 
Normal rank
Property / Recommended article: Associativity of recurrence multiplication / qualifier
 
Similarity Score: 0.8011726
Amount0.8011726
Unit1
Property / Recommended article: Associativity of recurrence multiplication / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2777493 / rank
 
Normal rank
Property / Recommended article: Q2777493 / qualifier
 
Similarity Score: 0.72862613
Amount0.72862613
Unit1
Property / Recommended article: Q2777493 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Fibonacci with a Golden Ring / rank
 
Normal rank
Property / Recommended article: Fibonacci with a Golden Ring / qualifier
 
Similarity Score: 0.71312773
Amount0.71312773
Unit1
Property / Recommended article: Fibonacci with a Golden Ring / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4839853 / rank
 
Normal rank
Property / Recommended article: Q4839853 / qualifier
 
Similarity Score: 0.7099323
Amount0.7099323
Unit1
Property / Recommended article: Q4839853 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Tribonacci multiplication / rank
 
Normal rank
Property / Recommended article: Tribonacci multiplication / qualifier
 
Similarity Score: 0.6919137
Amount0.6919137
Unit1
Property / Recommended article: Tribonacci multiplication / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5696251 / rank
 
Normal rank
Property / Recommended article: Q5696251 / qualifier
 
Similarity Score: 0.6778207
Amount0.6778207
Unit1
Property / Recommended article: Q5696251 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4206803 / rank
 
Normal rank
Property / Recommended article: Q4206803 / qualifier
 
Similarity Score: 0.6662447
Amount0.6662447
Unit1
Property / Recommended article: Q4206803 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4519622 / rank
 
Normal rank
Property / Recommended article: Q4519622 / qualifier
 
Similarity Score: 0.6639925
Amount0.6639925
Unit1
Property / Recommended article: Q4519622 / qualifier
 

Latest revision as of 20:44, 27 January 2025

scientific article
Language Label Description Also known as
English
Some remarks about Fibonacci multiplication
scientific article

    Statements

    Some remarks about Fibonacci multiplication (English)
    0 references
    0 references
    1989
    0 references
    The Fibonacci sequence is defined recursively by the formula \(F_{i+2}=F_ i+F_{i+1}\) for \(i\geq 0\) with \(F_ 0=0\) and \(F_ 1=1\). If n is a natural number it is well known that n has a unique ``Zeckendorf'' representation of the form \(n=\sum^{N}_{i=0}d_ iF_ i\), where \(d_ i=0\) or \(d_ i=1\) and \(d_ id_{i+1}=0\) for all i, and where \(d_ 0=d_ 1=0\). If the Zeckendorf representation of m is given by \(m=\sum^{M}_{j=0}e_ jF_ j,\) then \textit{D. E. Knuth} [Appl. Math. Lett. 1, No.1, 57-60 (1988; Zbl 0633.10011)] has defined the circle product of n and m by \(n\circ m=\sum^{N}_{i=0}\sum^{M}_{j=0}d_ ie_ jF_{i+j}\) and has proved that circle multiplication is an associative operation. In the present paper the author establishes the associativity of circle multiplication by using an algebraic, as opposed to a combinatorial, argument. Thus, if Z is the set of finite sequences \((d_ 0,d_ 1,...,d_ n)\) where the \(d_ i\) are subject to the Zeckendorf restrictions given above, and \((d_ 0,d_ 1,...,d_ n)_ X=\sum^{n}_{i=0}d_ iX^ i,\) then circle multiplication corresponds to ordinary multiplication modulo the rule \(X^ i+X^{i+1}=X^{i+2}\). Since the author proves that any element of the ring \({\mathbb{Z}}[X]/<X^ 2- X-1>\) has at most one representation of the form \((d_ 0,d_ 1,...,d_ n)_ X\) and that the set of these representations is closed under multiplication, the associativity of circle multiplication follows immediately.
    0 references
    Fibonacci multiplication
    0 references
    Zeckendorf representation
    0 references
    associativity of circle multiplication
    0 references

    Identifiers