Results 131 to 140 of about 1,475 (180)

Dynamic analysis of FN-HR neural network coupled of bistable memristor and encryption application based on Fibonacci Q-Matrix. [PDF]

Cogn Neurodyn
Sun J, Li C, Wang Y, Wang Z.
europepmc   +1 more source

Enhancing image security via chaotic maps, Fibonacci, Tribonacci transformations, and DWT diffusion: a robust data encryption approach. [PDF]

Sci Rep
Hazzazi MM, Rehman MU, Shafique A, Aljaedi A, Bassfar Z, Usman AB.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quotients of Fibonacci Numbers

The American Mathematical Monthly, 2016
AbstractThere have been many articles in the MONTHLY on quotient sets over the years. We take a first step here into the p-adic setting, which we hope will spur further research.
Stephan Ramon Garcia, Florian Luca
openaire   +2 more sources

Factorization of Fibonacci Numbers

The Fibonacci Quarterly, 1970
The Fibonacci numbers \(F_n\) may be defined by \(F_0 = 0\), \(F_1= 1\), \(F_{n+1}=F_n +F_{n-1}\) for \(n \geq 1\). If \(F_z\) \(z>0\), is the smallest Fibonacci number divisible by the prime \(p\), then \(z =a(p)\) is defined as the entry point (or rank) of \(p\); moreover \(p\) divides \(F_n\) if and only if \(n\) is divisible by \(z(p)\).
Daykin, D. E., Dresel, L. A. G.
openaire   +2 more sources

On the Fibonacci k-numbers

Chaos, Solitons & Fractals, 2007
Q1
Falcón, Sergio, Plaza, Ángel
openaire   +3 more sources

Fibonacci numbers as mixed concatenations of Fibonacci and Lucas numbers

Mathematica Slovaca
AbstractLet (Fn)n≥0and (Ln)n≥0be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations ofaandb, we mean the both concatenationsabandbatogether, whereaandbare any two nonnegative integers.
Altassan, Alaa, ALAN, Murat
openaire   +2 more sources

On Concatenations of Fibonacci and Lucas Numbers

Bulletin of the Iranian Mathematical Society, 2022
Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the usual Fibonacci and Lucas sequences defined respectively by the linear recurrence relations: \( F_0=0 \), \( F_1=1 \), \( F_{n+2}=F_{n+1}+F_n \) and \( L_0=2 \), \( L_1=1 \), \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \).
openaire   +2 more sources

On the Fibonacci numbers of the composition of graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez   +1 more
openaire   +1 more source

Fibonacci numbers with Fibonacci numbers as subscripts

2018
The original solution of Problem B-1203 in the problem section of this journal. It was acquired to prove two equalities for the sums with the Fibonacci numbers or the Lucas numbers whose indices are again the Fibonacci numbers and the Lucas numbers, respectively.
openaire   +1 more source

A Logarithmic Formula for Fibonacci Numbers

The Fibonacci Quarterly, 1966
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources