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: | , |
|---|---|
| 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 |