Periods of 𝑘-step Fibonacci functions modulo 𝑚
For an integer 𝑘 ≥ 2, a 𝑘-step Fibonacci function is a function 𝑓: ℤ → ℤ defined by 𝑓(𝑛 + 𝑘) = 𝑓(𝑛 + 𝑘 − 1) + 𝑓(𝑛 + 𝑘 − 2) + ⋯ + 𝑓(𝑛) for any integer 𝑛. We mainly show the existence of primitive period of a 𝑘-step Fibonacci function in modulo 𝑚. Moreover, the explicit primitive period of a 𝑘-step...
Main Authors: | Yanapat Tongron, Supattra Kerdmongkon |
---|---|
Format: | Article |
Language: | English |
Published: |
Prince of Songkla University
2022-04-01
|
Series: | Songklanakarin Journal of Science and Technology (SJST) |
Subjects: | |
Online Access: | https://rdo.psu.ac.th/sjst/journal/44-2/6.pdf |
Similar Items
-
On the Bicomplex $k$-Fibonacci Quaternions
by: Fügen Torunbalcı Aydın
Published: (2019-09-01) -
Some remarks regarding the $(p,q)-$Fibonacci and Lucas octonion polynomials
by: Arzu Özkoç Öztürk, et al.
Published: (2018-03-01) -
Error detection and correction for coding theory on k-order Gaussian Fibonacci matrices
by: Suleyman Aydinyuz, et al.
Published: (2023-01-01) -
On the Reciprocal Sums of Products of Two Generalized Bi-Periodic Fibonacci Numbers
by: Younseok Choo
Published: (2021-01-01) -
Some Combinatorial Properties of the k-Fibonacci and the k-Lucas Quaternions
by: Ramírez José L.
Published: (2015-06-01)