Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Fibonacci numbers as mixed concatenations of Fibonacci and Lucas numbers
View through CrossRef
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. So, the mathematical formulation of this problem leads us searching the solutions of two Diophantine equationsFn= 10dFm+LkandFn= 10dLm+Fkin nonnegative integers (n,m,k), whereddenotes the number of digits ofLkandFk, respectively. We use lower bounds for linear forms in logarithms and reduction method in Diophantine approximation to get the results.
Title: Fibonacci numbers as mixed concatenations of Fibonacci and Lucas numbers
Description:
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.
So, the mathematical formulation of this problem leads us searching the solutions of two Diophantine equationsFn= 10dFm+LkandFn= 10dLm+Fkin nonnegative integers (n,m,k), whereddenotes the number of digits ofLkandFk, respectively.
We use lower bounds for linear forms in logarithms and reduction method in Diophantine approximation to get the results.
Related Results
Some Properties of the Fibonacci Sequence
Some Properties of the Fibonacci Sequence
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...
Automaquiagem com Lucas Vieira Funciona? | Automaquiagem com Lucas Vieira Site Oficial | Automaquiagem com Lucas Vieira é Confiável?
Automaquiagem com Lucas Vieira Funciona? | Automaquiagem com Lucas Vieira Site Oficial | Automaquiagem com Lucas Vieira é Confiável?
Automaquiagem com Lucas Vieira Funciona? | Automaquiagem com Lucas Vieira Site Oficial | Automaquiagem com Lucas Vieira é Confiável?
Automaquiagem com Lucas Vieira: Tudo o Que Vo...
Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions
Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions
We have investigated new Pauli Fibonacci and Pauli Lucas quaternions by taking the components of these quaternions as Gaussian Fibonacci and Gaussian Lucas numbers, respectively. W...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background
The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known work is Mulatu’s ...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known work is Mulatu’s ...
Exploring fibonacci cordiality in corona graphs
Exploring fibonacci cordiality in corona graphs
A Fibonacci cordial (FC) labeling of a graph G is an injective function f : V(G) → {F0, F1, …, Fn}, where Fi is the ith Fibonacci number, such that the induced edge labeling f*(uv)...
Representation of Integers as Sums of Fibonacci and Lucas Numbers
Representation of Integers as Sums of Fibonacci and Lucas Numbers
Motivated by the Elementary Problem B-416 in the Fibonacci Quarterly, we show that, given any integers n and r with n≥2, every positive integer can be expressed as a sum of Fibonac...