On the Lucas Property of Linear Recurrent Sequences
classification
🧮 math.NT
keywords
lucasmathbbpropertyequationsequencesarithmeticalbegindiscuss
read the original abstract
We say that an arithmetical function $S:\mathbb{N}\rightarrow\mathbb{Z}$ has Lucas property if for any prime $p$, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where $n=\sum_{i=0}^{r}n_{i}p^{i}$, with $0 \leq n_{i} \leq p-1,n,n_{i}\in\mathbb{N}$. In this note, we discuss the Lucas property of Fibonacci sequences and Lucas numbers. Meanwhile, we find some other interesting results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.