Related papers: The Fibonacci sequence modulo $p^2$ -- An investig…

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

In this paper, we show that if $p\equiv 1\pmod 4$ is prime, then $4F_p$ admits a representation of the form $u^2-pv^2$ for some integers $u$ and $v$, where $F_n$ is the $n$th Fibonacci number. We prove a similar result when $p\equiv -1\pmod…

Let $p$ be a prime number. A chain $\{p,2p+1,4p+3,\cdots,(p+1)2^{l(p)-1}-1\}$ is called the Cunningham chain generated by $p$ if all elements are prime number and $(p+1)2^{l(p)}-1$ is composite. Then $l(p)$ is called the length of the…

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

The Fibonacci sequence modulo $m$, which we denote $\left(\mathcal{F}_{m,n}\right)_{n=0}^\infty$ where $\mathcal{F}_{m,n}$ is the Fibonacci number $F_n$ modulo $m$, has been a well-studied object in mathematics since the seminal paper by…

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

For a given prime $p$, we determine the limit, as $\lambda \to \infty$, of the density of residues modulo $p^\lambda$ attained by the Fibonacci sequence. In particular, we show that this limiting density is related to zeros in the sequence…

In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

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 \…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…

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…

A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

In this paper we show that for any prime number $p$ not equal to $11$ or $19$, the Tribonacci number $T_{p-1}$ is divisible by $p$ if and only if $p$ is of the form $x^2+11y^2$. We first use class field theory on the Galois closure of the…

It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenth- or seventeenth powers in the Fibonacci sequence. For eleventh, thirteenth- and seventeenth powers an alternative (to the usual exhaustive check of products…