Results 11 to 20 of about 24,784 (197)
Some Identities Involving Fibonacci Polynomials and Fibonacci Numbers
The aim of this paper is to research the structural properties of the Fibonacci polynomials and Fibonacci numbers and obtain some identities. To achieve this purpose, we first introduce a new second-order nonlinear recursive sequence. Then, we obtain our
Yuankui Ma, Wenpeng Zhang
doaj +3 more sources
Fibonacci sequences in groupoids [PDF]
Abstract In this article, we consider several properties of Fibonacci sequences in arbitrary groupoids (i.e., binary systems). Such sequences can be defined in a left-hand way and a right-hand way. Thus, it becomes a question of interest to decide when these two ways are equivalent, i.e., when they produce the same sequence for the same ...
Han, Jeong Soon +2 more
openaire +2 more sources
Generalized Fibonacci Sequences for Elliptic Curve Cryptography
The Fibonacci sequence is a well-known sequence of numbers with numerous applications in mathematics, computer science, and other fields. In recent years, there has been growing interest in studying Fibonacci-like sequences on elliptic curves.
Zakariae Cheddour +2 more
doaj +1 more source
Conway's Subprime Fibonacci Sequences [PDF]
18 pages, 5 ...
Guy, Richard K. +2 more
openaire +2 more sources
On the 2k-step Jordan-Fibonacci sequence
In this paper, we define the 2k-step Jordan-Fibonacci sequence, and then we study the 2k-step Jordan-Fibonacci sequence modulo m. Also, we obtain the cyclic groups from the multiplicative orders of the generating matrix of the 2k-step Jordan-Fibonacci ...
Omur Deveci, Sait Taş, A Kılıçman
doaj +1 more source
On ideal convergence Fibonacci difference sequence spaces
The Fibonacci sequence was firstly used in the theory of sequence spaces by Kara and Başarir (Casp. J. Math. Sci. 1(1):43–47, 2012). Afterward, Kara (J. Inequal. Appl.
Vakeel A. Khan +4 more
doaj +1 more source
Generalized Fibonacci-like sequence and Fibonacci sequence
Every term in the Fibonacci Sequence can be determined recursively with the help of initial values F0 = 0, F1 = 1. Similar is the case with Lucas Sequence. In this paper, we study Generalized Fibonacci-Like sequence {Dn} defined by the recurrence relation Dn = Dn-1 + Dn-2, for all n 2 with D0 = 2 and D1 = 1+m, m being a fixed positive integer.
Sanjay Harne +2 more
openaire +1 more source
Some properties of the generalized (p,q)- Fibonacci-Like number
For the real world problems, we use some knowledge for explain or solving them. For example, some mathematicians study the basic concept of the generalized Fibonacci sequence and Lucas sequence which are the (p,q) – Fibonacci sequence and the (p,q ...
Suvarnamani Alongkot
doaj +1 more source
The number of valid factorizations of Fibonacci prefixes [PDF]
We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words.
Bonardo, Pierre +2 more
core +5 more sources
On the Smarandache sequences [PDF]
In this paper, one uses the elementary method to study the convergence of the Smarandache alternate consecutive, reverse Fibonacci sequence and Smarandache multiple ...
Yang, Yanting
core +1 more source

