Results 21 to 30 of about 3,045 (188)
Fibonacci Identities via Fibonacci Functions
We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it independent} components.
openaire +3 more sources
The complex-type cyclic-Fibonacci sequence and its applications [PDF]
In the present paper, we aim to generalize the notion of complex-type Fibonacci sequences to complex-type cyclic Fibonacci sequences. Firstly, we define the complex-type cyclic-Fibonacci sequence and then we give miscellaneous properties of this ...
Ömür Deveci +2 more
doaj +1 more source
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent ...
Euler Reinhardt +2 more
doaj +1 more source
The phyllotaxis of the aortic valve
Biological systems ubiquitously and inevitably exhibit stochasticity in traits from the molecular level to the multicellular and morphological level.
Marco Moscarelli, Ruggero De Paulis
doaj +1 more source
Novel Fibonacci and non-Fibonacci structure in the sunflower: results of a citizen science experiment [PDF]
This citizen science study evaluates the occurrence of Fibonacci structure in the spirals of sunflower (Helianthus annuus) seedheads. This phenomenon has competing biomathematical explanations, and our core premise is that observation of both Fibonacci ...
Jonathan Swinton, Erinma Ochu,
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
Editorial: A note on Papal Mathematics [PDF]
Many recent media claims that Pope Leo XIV, Robert F. Prevost, born in the USA and elected in 2025 in succession to Pope Francis, is the first mathematician to become the Pope of the Catholic Church are questionable. That honour probably belongs to Pope
Anthony G. Shannon
doaj +1 more source
Bi-Periodic (p,q)-Fibonacci and Bi-Periodic (p,q)-Lucas Sequences
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 +1 more
doaj +1 more source
Fibonacci Modules and Multiple Fibonacci Sequences
Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
openaire +2 more sources
The Fibonacci Dimension of a Graph [PDF]
The Fibonacci dimension ${\rm fdim}(G)$ of a graph $G$ is introduced as the smallest integer $f$ such that $G$ admits an isometric embedding into $\Gamma_f$, the $f$-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of the isometric and lattice dimension, provide a combinatorial characterization of the Fibonacci
Cabello, Sergio +2 more
openaire +4 more sources

