Fibonacci multiplication (Q1095961): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56502855, #quickstatements; #temporary_batch_1704695633138 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56502855 / rank | |||
Normal rank |
Revision as of 07:36, 8 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fibonacci multiplication |
scientific article |
Statements
Fibonacci multiplication (English)
0 references
1988
0 references
The Fibonacci sequence \(\{F_ n\}\) is defined as follows: \(F_ 0=0\), \(F_ 1=1\), \(F_ k=F_{k-1}+F_{k-2}\) for \(k\geq 2\). A well-known theorem, due to Zeckendorf, states that every natural number has a unique representation as a sum of distinct Fibonacci numbers, if we stipulate that \(F_ 0\) and \(F_ 1\) are not used in the representation and that if \(F_ a\) and \(F_ b\) are used then \(| a-b| >1.\) If the Zeckendorf representations of m and n are \(m=F_{jq}+...+F_{j1}\) and \(n=F_{kr}+...+F_{k1}\), then the ``circle product'' of m and n is defined as follows: \(m\circ n=\sum^{q}_{b=1}\sum^{r}_{c=1}F_{jb+kc}.\) In particular, \(F_ j\circ F_ k=F_{j+k}\) if \(j\geq 2\) and \(k\geq 2\). It is proved in this paper that circle multiplication is an associative operation.
0 references
Fibonacci numbers
0 references
Zeckendorf representations
0 references
circle product
0 references
associative operation
0 references