2000 character limit reached
On the Lucas Property of Linear Recurrent Sequences
Published 25 Mar 2016 in math.NT | (1603.07863v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.