Results 21 to 30 of about 12,719 (235)
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
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
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
Altered Numbers of Fibonacci Number Squared
We investigate two types of altered Fibonacci numbers obtained by adding or subtracting a specific value $\{a\}$ from the square of the $n^{th}$ Fibonacci numbers $G^{(2)}_{F(n)}(a)$ and $H^{(2)}_{F(n)}(a)$.
Emre Kankal, Fikri Köken
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 +3 more sources
There are no multiply-perfect Fibonacci numbers
Here, we show that no Fibonacci number (larger than 1) divides the sum of its ...
Lewis, Ryan H. +11 more
core +1 more source
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
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

