On the Lucas Property of Linear Recurrent Sequences

preprint2016arXivOpen access

Abstract

We say that an arithmetical function S:N→ZS:\mathbb{N}\rightarrow\mathbb{Z} has Lucas property if for any prime pp, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where n=∑i=0rnipin=\sum_{i=0}^{r}n_{i}p^{i}, with 0≤ni≤p−1,n,ni∈N0 \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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.