Results 11 to 20 of about 9,659,868 (257)
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$.
C. Sanna
openaire +3 more sources
Fibonacci number of the tadpole graph
Electronic Journal of Graph Theory and Applications, 2014 In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle ...
Joe DeMaio, John Jacobson
doaj +2 more sources
Generalized Fibonacci numbers and automorphisms of K3 surfaces with Picard number 2 [PDF]
arXivUsing the properties of generalized Fibonacci numbers, we determine the automorphism groups of some K3 surfaces with Picard number 2. Conversely, using the automorphisms of K3 surfaces with Picard number 2, we prove the criterion for a given integer n is to be a generalized Fibonacci number.
Kwangwoo Lee
arxiv +3 more sources
Kin Competition Drives the Evolution of Earlier Metamorphosis. [PDF]
Ecol EvolWe develop a mathematical model to investigate how kin selection shapes the optimal timing of metamorphosis. We consider the full range of larval competition intensities and the full range of relatedness coefficients. This yields testable predictions as to how kin selection modulates the timing of metamorphosis.
Dong B, Gardner A.
europepmc +2 more sources
Pseudo-random number generator based on linear congruence and delayed Fibonacci method
Technical Sciences, 2021 Pseudo-random number generation techniques are an essential tool to correctly test machine learning processes. The methodologies are many, but also the possibilities to combine them in a new way are plenty.
Radosław Cybulski
openalex +3 more sources
Some equalities and binomial sums about the generalized Fibonacci number $u_n$ [PDF]
Notes on Number Theory and Discrete Mathematics, 2022 In this study, we take the generalized Fibonacci sequence \{u_{n}\} as u_{0}=0,u_{1}=1 and \ u_{n}=ru_{n-1}+u_{n-2} for n>1, where r is a non-zero integer.
Yücel Türker Ulutaş, Derya Toy
openalex +2 more sources
On the golden number and Fibonacci type sequences
, 2020 The paper presents, among others, the golden number $\varphi$ as the limit of the quotient of neighboring terms of the Fibonacci and Fibonacci type sequence by means of a fixed point of a mapping of a certain interval with the help of Edelstein's theorem.
Eugeniusz Barcz
openalex +3 more sources
A Curious Property of the Eleventh Fibonacci Number [PDF]
, 1995 B.M.M. de Weger
openalex +2 more sources
Statistics on restricted Fibonacci words [PDF]
Transactions on Combinatorics, 2021 We study two foremost Mahonian statistics, the major index and the inversion number for a class of binary words called restricted Fibonacci words. The language of restricted Fibonacci words satisfies recurrences which allow for the calculation of the ...
Omer Egecloglu
doaj +1 more source
Improving a constructive heuristic for the general routing problem
Networks, Volume 81, Issue 1, Page 93-106, January 2023., 2023 Abstract The general routing problem (GRP) is a fundamental 𝒩𝒫‐hard vehicle routing problem, first defined by Orloff in 1974. It contains as special cases the Chinese postman problem, the rural postman problem, the graphical TSP, and the Steiner TSP. We examine in detail a known constructive heuristic for the GRP, due to Christofides and others.
Burak Boyacı +2 more
wiley +1 more source