Related papers: A Novel Fibonacci Pattern in Pascal's Triangle
In this paper we develop a new geometric method to answer the log-concavity questions related to a nice class of combinatorial sequences arising from the Pascal triangle.
The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of $p$ is $p+1$. We study the fibonomial triangle mod 5, showing with a…
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…
Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.
In order to better understand dynamical functions on amounts of natural and man-made complex systems, lots of researchers from a wide range of disciplines, covering statistic physics, mathematics, theoretical computer science, and so on,…
Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
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…
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…
Given an infinite word, enumerating its factors is an important exercise for understanding the structure of the word. The process of finding all the factors is quite tricky for two-dimensional words. In this paper, two possible ways of…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
The generalised random Fibonacci chain is a stochastic extension of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 1^i01^{m-i}$ with probability $p_i$, where $p_i\geq 0$ with…
An integer sequence is called realizable if it is the count of periodic points of some map. The Fibonacci sequence $(F_n)$ does not have this property, and the Fibonacci sequence sampled along the squares $(F_{n^2})$ also does not have this…
The Farey sequence is the sequence of all rational numbers in the real unit interval, stratified by increasing denominators. A classical result by Hall says that its normalized gap distribution is the same as the distribution of the random…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
In 2009, Sagan and Savage introduced a combinatorial model for the Fibonomial numbers, integer numbers that are obtained from the binomial coefficients by replacing each term by its corresponding Fibonacci number. In this paper, we present…
In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
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…
In this paper, the authors propose the utilization of Fibonacci Neural Networks (FNN) for solving arbitrary order differential equations. The FNN architecture comprises input, middle, and output layers, with various degrees of Fibonacci…