Related papers: The asymptotic estimation for two classes of gener…

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.

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…

Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…

The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

We consider the three conjectures stated in a 2003 paper of Wu, concerning the asymptotics of particular sums of products of binomials, powers and logarithms. These sums relate to the form of the regularised integrals used in loop…

Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for…

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

Within the framework of likelihood-based statistical tests for high energy physics measurements, we derive generalized expressions for estimating the statistical significance of discovery using the asymptotic approximations of Wilks and…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured…

In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.

We study arithmetic and asymptotic properties of polynomials provided by $Q_n(x):= x \sum_{k=1}^n k \, Q_{n-k}(x)$ with initial value $Q_0(x)=1$. The coefficients satisfy a central limit theorem and a local limit theorem involving Fibonacci…

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.