Results 21 to 30 of about 31,396 (204)
New Properties and Identities for Fibonacci Finite Operator Quaternions
In this paper, with the help of the finite operators and Fibonacci numbers, we define a new family of quaternions whose components are the Fibonacci finite operator numbers. We also provide some properties of these types of quaternions.
Nazlıhan Terzioğlu +2 more
doaj +1 more source
On the Inverse of a Fibonacci Number Modulo a Fibonacci Number Being a Fibonacci Number
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 representatives $\{0, 1, \dots, b-1\}$. Put also $[a^{-1} \!\bmod b] := \infty$ when $\gcd(a, b) > 1$.
openaire +2 more sources
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
A permutation $ \in S_n$ is said to {\it avoid} a permutation $ \in S_k$ whenever $ $ contains no subsequence with all of the same pairwise comparisons as $ $. For any set $R$ of permutations, we write $S_n(R)$ to denote the set of permutations in $S_n$ which avoid every permutation in $R$. In 1985 Simion and Schmidt showed that $|S_n(132, 213, 123)
Egge, Eric S., Mansour, Toufik
openaire +3 more sources
On Fibonacci functions with Fibonacci numbers [PDF]
Abstract In this paper we consider Fibonacci functions on the real numbers R, i.e., functions f : R → R such that for all x ∈ R ,
Han, Jeong, Kim, Hee, Neggers, Joseph
openaire +2 more sources
Some Properties of Fibonacci Numbers, Generalized Fibonacci Numbers and Generalized Fibonacci Polynomial Sequences [PDF]
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 modulo an integer, $m$ and derive certain interesting properties related to them.
Laugier, Alexandre, Saikia, Manjil P.
openaire +3 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
Some Identities Involving Fibonacci Polynomials and Fibonacci Numbers [PDF]
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 main results by using this new sequence, the properties of the power series, and the combinatorial ...
Ma, Yuankui, Zhang, Wenpeng
openaire +3 more sources
Edge-Disjoint Fibonacci Trees in Hypercube
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the Fibonacci numbers. In this paper, we prove that a hypercube of dimension h admits two edge-disjoint Fibonacci trees of height h, two edge ...
Indhumathi Raman, Lakshmanan Kuppusamy
doaj +1 more source
On the Bicomplex $k$-Fibonacci Quaternions
In this paper, bicomplex $k$-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex $k$-Fibonacci quaternions are investigated.
Fügen Torunbalcı Aydın
doaj +1 more source
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source

