A dynamical property unique to the Lucas sequence

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.

We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci sequence is complete mod $m$. We extend this work to all Gibonacci sequences, concluding by determining the set of $m$ in which a generic Gibonacci sequence containing the relatively prime consecutive terms $a, b$ is complete mod $m$.

In this paper, we introduce the bi-periodic Lucas matrix sequence and present some fundamental properties of this generalized matrix sequence. Moreover, we investigate the important relationships between the bi-periodic Fibonacci and Lucas matrix sequences. We express that some behaviours of bi-periodic Lucas numbers also can be obtained by considering properties of this new matrix sequence. Finally, we say that the matrix sequences as Lucas, $k$-Lucas and Pell-Lucas are spec...

We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.

In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth order of the terms of Lucas sequences that are independent of the parameters of the sequence, which is a new feature.

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

We give necessary and sufficient conditions for a Fibonacci cycle to be residue complete (nondefective). In particular, the Lucas numbers modulo m is residue complete if and only if m = 2,4,6,7,14 or a power of 3.

In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations.

By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph associated to the recurrence relation.

A composite positive integer n is Lehmer if \phi(n) divides n-1, where \phi(n) is the Euler's totient function. No Lehmer number is known, nor has it been proved that they don't exist. In 2007, the second author [7] proved that there is no Lehmer number in the Fibonacci sequence. In this paper, we adapt the method from [7] to show that there is no Lehmer number in the companion Lucas sequence of the Fibonacci sequence $(L_n)_{n\geq 0}$ given by $L_0 = 2, L_1 = 1$ and $L_{n+2}...