Results 21 to 30 of about 2,249 (234)

Bi-Periodic (p,q)-Fibonacci and Bi-Periodic (p,q)-Lucas Sequences

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023
In this paper, we define bi-periodic (p,q)-Fibonacci and bi-periodic (p,q)-Lucas sequences, which generalize Fibonacci type, Lucas type, bi-periodic Fibonacci type and bi-periodic Lucas type sequences, using recurrence relations of (p,q)-Fibonacci and (p,
Yasemin Taşyurdu, Naime Şeyda Türkoğlu   +1 more
doaj   +1 more source

Some fundamental Fibonacci number congruences [PDF]

Notes on Number Theory and Discrete Mathematics
This paper investigates a number of congruence properties related to the coefficients of a generalized Fibonacci polynomial. This polynomial was defined to produce properties comparable with those of the standard polynomials of some special functions ...
Anthony G. Shannon, Tian-Xiao He, Peter J.-S. Shiue, Shen C. Huang   +3 more
doaj   +1 more source

Diophantine equations with Lucas and Fibonacci number coefficients [PDF]

Notes on Number Theory and Discrete Mathematics
Fibonacci and Lucas numbers are special number sequences that have been the subject of many studies throughout history due to the relations they provide.
Cemil Karaçam, Alper Vural, Bilal Aytepe, Ferhat Yıldız   +3 more
doaj   +1 more source

Tunable multichannel Fibonacci one-dimensional terahertz photonic crystal filter

Scientific Reports, 2023
This paper proposes a multichannel terahertz optical filter based on a one-dimensional photonic crystal with a third-order Fibonacci structure, including a bulk Dirac semimetal.
V. Sepahvandi, B. Rezaei, A. H. Aly
doaj   +1 more source

Some properties of the generalized (p,q)- Fibonacci-Like number

MATEC Web of Conferences, 2018
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

Power Fibonacci sequences in quadratic integer modulo m [PDF]

Notes on Number Theory and Discrete Mathematics
The power Fibonacci sequence in ℤₘ[√δ] is defined as a Fibonacci sequence Fₙ=Fₙ₋₁+Fₙ₋₂ where F₀=1 and F₁=a, such that a∈ℤₘ[√δ] and Fₙ≡aⁿ(mod m), for all n∈ℕ∪{0}. In this paper, we investigated the existence of power Fibonacci sequences in ℤₘ[√δ], and the
Paul Ryan A. Longhas, Cyryn Jade L. Prendol, Jenelyn F. Bantilan, Larra L. De Leon   +3 more
doaj   +1 more source

The Fibonacci numbers of certain subgraphs of circulant graphs

AKCE International Journal of Graphs and Combinatorics, 2015
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez   +1 more
doaj   +1 more source

New Properties and Identities for Fibonacci Finite Operator Quaternions

Mathematics, 2022
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, Can Kızılateş, Wei-Shih Du   +2 more
doaj   +1 more source

On the Inverse of a Fibonacci Number Modulo a Fibonacci Number Being a Fibonacci Number

Mediterranean Journal of Mathematics, 2023
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

, 2002
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