Period patterns, entry points, and orders in the Lucas sequences: theory and applications
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916543019876352 |
|---|---|
| author | Fiebig, Morgan Mbirika, aBa Spilker, Jürgen |
| author_facet | Fiebig, Morgan Mbirika, aBa Spilker, Jürgen |
| contents | The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2) apply some of this theory to a novel graphical approach of $U$ and $V$ modulo $m$. Upon placing the cycle of repeating sequence terms in a circle, several fascinating patterns which would otherwise be overlooked emerge. We generalize a wealth of known Fibonacci and Lucas statistical identities to the $U$ and $V$ settings using primary sources such as Lucas in 1878, Carmichael in 1913, Wall in 1960, and Vinson in 1963, amongst others. We use many of these generalized identities to form the theoretical basis for our graphical results. Based on the order of $m$, defined as $ω(m) := \frac{π(m)}{e(m)}$, where $π(m)$ is the period of $m$ and $e(m)$ is the entry point of $m$, we describe behaviors shared by $U$ and $V$ with parameters $q = \pm 1$. In particular, we exhibit some tantalizing examples in the following three sequence pairs: Fibonacci and Lucas, Pell and associated Pell, and balancing and Lucas-balancing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14632 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Period patterns, entry points, and orders in the Lucas sequences: theory and applications Fiebig, Morgan Mbirika, aBa Spilker, Jürgen Number Theory Combinatorics 11B39 (Primary), 11B50 (Secondary) The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2) apply some of this theory to a novel graphical approach of $U$ and $V$ modulo $m$. Upon placing the cycle of repeating sequence terms in a circle, several fascinating patterns which would otherwise be overlooked emerge. We generalize a wealth of known Fibonacci and Lucas statistical identities to the $U$ and $V$ settings using primary sources such as Lucas in 1878, Carmichael in 1913, Wall in 1960, and Vinson in 1963, amongst others. We use many of these generalized identities to form the theoretical basis for our graphical results. Based on the order of $m$, defined as $ω(m) := \frac{π(m)}{e(m)}$, where $π(m)$ is the period of $m$ and $e(m)$ is the entry point of $m$, we describe behaviors shared by $U$ and $V$ with parameters $q = \pm 1$. In particular, we exhibit some tantalizing examples in the following three sequence pairs: Fibonacci and Lucas, Pell and associated Pell, and balancing and Lucas-balancing. |
| title | Period patterns, entry points, and orders in the Lucas sequences: theory and applications |
| topic | Number Theory Combinatorics 11B39 (Primary), 11B50 (Secondary) |
| url | https://arxiv.org/abs/2408.14632 |