Braided Gibonacci sequences on residue classes (Q6606740)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Braided Gibonacci sequences on residue classes |
scientific article; zbMATH DE number 7914641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Braided Gibonacci sequences on residue classes |
scientific article; zbMATH DE number 7914641 |
Statements
Braided Gibonacci sequences on residue classes (English)
0 references
17 September 2024
0 references
In the paper under review, the authors consider ``Braided Gibonacci sequences on residue classes''\N\NRecall that the function \(f:\mathbb{Z}\rightarrow \mathbb{Z}\) defined\N\[ \Nf(n+2)=f(n+1)+f(n)\N\] \Nfor \(n\in \mathbb{Z}\) is called a Gibonacci sequence.\N\NFor any Gibonacci sequences \((f_{n})\) and \((g_{n})\), they set\N\[ \Nh_{n}=\left\{ \begin{array}{cc} f_{n} & n\text{ is even} \\\Ng_{n} & n\text{ is odd} \end{array} \right.\N\] \Nand\N\[ \Nk_{n}=\left\{ \begin{array}{cc} g_{n} & n\text{ is even} \\\Nf_{n} & n\text{ is odd} \end{array} \right.\N\] \Nand prove \N\N\textbf{Theorem 1.1.} Let \(a\) be an odd integer, \(b\in \mathbb{Z}\) and \(a\) shift \(s=1,2,3\). We define\N\[ \N\delta (n)=\left\{ \begin{array}{cc} 2 & an+b\equiv 1\pmod 3, s=3 \\\N1 & \text{otherwise.} \end{array} \right.\N\] \NThen for all \(n\in \mathbb{Z}\), we have\N\N\textbf{(1)}\ \(h_{n}^{(a,b)}=\frac{1}{\delta (n)}\gcd \left( F_{2an+2b-1}+(-1)^{b+1},F_{2an+2b-1+s}+(-1)^{b+1}F_{s-1}\right).\)\N\N\textbf{(2)}\ \(k_{n}^{(a,b)}=\frac{1}{\delta (n)}\gcd \left( F_{2an+2b-1}+(-1)^{b},F_{2an+2b-1+s}+(-1)^{b}F_{s-1}\right),\) where\N\[ \Nh_{n}^{(a,b)}=\left\{ \begin{array}{cc} F_{an+b} & n\text{ is even} \\\NL_{an+b} & n\text{ is odd} \end{array} \right.\N\] \Nand\N\[ \Nk_{n}^{(a,b)}=\left\{ \begin{array}{cc} L_{an+b} & n\text{ is even} \\\NF_{an+b} & n\text{ is odd} \end{array} \right.\N\] \Nand \(F_{n}\) is the Fibonacci sequence and \(L_{n}\) is the Lucas sequence .\N\N\bigskip\N\N\bigskip Taking \(a=1\), they get\N\N\textbf{Corollary 1.2.} Let \(b,n\in \mathbb{Z}\), we have\N\N\textbf{(1)}\ \(h_{n}^{(1,b)}=\gcd \left( F_{2n+2b-1}+(-1)^{b+1},F_{2n+2b}\right) .\)\N\N\textbf{(2)}\ \(k_{n}^{(1,b)}=\gcd \left( F_{2n+2b-1}+(-1)^{b},F_{2n+2b}\right) .\)\N\N\bigskip\N\N\bigskip\N\NAnd taking \(a=3\), they get\N\N\textbf{Corollary 1.3.} Let \(b,n\in \mathbb{Z}\), we have\N\N\textbf{(1)\ }\(h_{n}^{(3,b)}=\gcd \left( F_{6n+2b-1}+(-1)^{b+1},F_{6n+2b}\right) .\)\N\N\textbf{(2)}\ \(k_{n}^{(3,b)}=\gcd \left( F_{6n+2b-1}+(-1)^{b},F_{6n+2b}\right) .\)\N\N\bigskip\N\N\bigskip\N\NThey also deduced some related results.\N\NFor the entire collection see [Zbl 1530.11003].
0 references
Fibonacci sequence
0 references
braided sequences
0 references
0.7328433990478516
0 references
0.7321248650550842
0 references
0.7273142337799072
0 references