相关论文: The Fibonacci Sequence Mod m

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

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…

We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…

In this paper, we study natural numbers $m$ with ${u_{z \pm 1} \equiv -1 \ (m)}$ for a $z \in \mathbb{N}$, where $u_n$ is the $n$th Fibonacci number. Furthermore, we want to show for $m \in \mathbb{N}\setminus\{0,1\}$: $[\forall p \…

This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is…

An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…

We study the $K$-Fibonacci sequence $\mathcal{F}_p$ modulo prime $p$. Cardinalities of sets $|\mathcal{F}_p+\mathcal{F}_p|$ and $|\mathcal{F}_p\cdot\mathcal{F}_p|$ are estimated. We present the method of estimating doubling constant of some…

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

We show that for primes $p < 10^{14}$ the period length $\kappa (p^2)$ of the Fibonacci sequence modulo $p^2$ is never equal to its period length modulo $p$. The investigation involves an extensive search by computer. As an application, we…

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

We study the period of the linear map $T:\mathbb{Z}_m^n\rightarrow \mathbb{Z}_m^n:(a_0,\dots,a_{n-1})\mapsto(a_0+a_1,\dots,a_{n-1}+a_0)$ as a function of $m$ and $n$, where $\mathbb{Z}_m$ stands for the ring of integers modulo $m$. Since…

Let $\{G_n\}$ be a periodic sequence of integers modulo $m$ and let $\{SG_n\}$ be the partial sum sequence defined by $SG_n:= \sum_{k=0}^nG_k $ (mod $m$). We give a formula for the period of $\{SG_n\}$. We also show that for a generalized…

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

This work introduces a method for constructing polyphase alternating codes in which the length of a code transmission cycle can be $p^m$ or $p-1$, where $p$ is a prime number and $m$ is a positive integer. The relevant properties leading to…

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

Let ${\mathcal F}=(F_i:i\ge 0)$ be the sequence of Fibonacci numbers, and $j$ and $e$ be non negative integers. We study the periodicity of the power Fibonacci sequences ${\mathcal F}^e(F_j)=(F_i^e\pmod{F_j}: i\ge 0)$. It is shown that for…

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…