Displaying similar documents to “Some identities involving differences of products of generalized Fibonacci numbers”

On a generalization of the Pell sequence

Jhon J. Bravo, Jose L. Herrera, Florian Luca (2021)

Mathematica Bohemica

Similarity:

The Pell sequence ( P n ) n = 0 is the second order linear recurrence defined by P n = 2 P n - 1 + P n - 2 with initial conditions P 0 = 0 and P 1 = 1 . In this paper, we investigate a generalization of the Pell sequence called the k -generalized Pell sequence which is generated by a recurrence relation of a higher order. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences. Some interesting identities involving the Fibonacci and generalized Pell numbers...

Some interpretations of the ( k , p ) -Fibonacci numbers

Natalia Paja, Iwona Włoch (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper we consider two parameters generalization of the Fibonacci numbers and Pell numbers, named as the ( k , p ) -Fibonacci numbers. We give some new interpretations of these numbers. Moreover using these interpretations we prove some identities for the ( k , p ) -Fibonacci numbers.

Explicit algebraic dependence formulae for infinite products related with Fibonacci and Lucas numbers

Hajime Kaneko, Takeshi Kurosawa, Yohei Tachiya, Taka-aki Tanaka (2015)

Acta Arithmetica

Similarity:

Let d ≥ 2 be an integer. In 2010, the second, third, and fourth authors gave necessary and sufficient conditions for the infinite products k = 1 U d k - a i ( 1 + ( a i ) / ( U d k ) ) (i=1,...,m) or k = 1 V d k - a i ( 1 + ( a i ) ( V d k ) (i=1,...,m) to be algebraically dependent, where a i are non-zero integers and U n and V n are generalized Fibonacci numbers and Lucas numbers, respectively. The purpose of this paper is to relax the condition on the non-zero integers a 1 , . . . , a m to non-zero real algebraic numbers, which gives new cases where the infinite products above are algebraically...

Lucas factoriangular numbers

Bir Kafle, Florian Luca, Alain Togbé (2020)

Mathematica Bohemica

Similarity:

We show that the only Lucas numbers which are factoriangular are 1 and 2 .

On the golden number and Fibonacci type sequences

Eugeniusz Barcz (2019)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The paper presents, among others, the golden number ϕ 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. To demonstrate the equality  , where f n is n -th Fibonacci number also the formula from Corollary has been applied. It was obtained using some relationships between Fibonacci and Lucas numbers, which were previously justified.

Pell and Pell-Lucas numbers of the form - 2 a - 3 b + 5 c

Yunyun Qu, Jiwen Zeng (2020)

Czechoslovak Mathematical Journal

Similarity:

In this paper, we find all Pell and Pell-Lucas numbers written in the form - 2 a - 3 b + 5 c , in nonnegative integers a , b , c , with 0 max { a , b } c .

A new proof of the q -Dixon identity

Victor J. W. Guo (2018)

Czechoslovak Mathematical Journal

Similarity:

We give a new and elementary proof of Jackson’s terminating q -analogue of Dixon’s identity by using recurrences and induction.

Repdigits in generalized Pell sequences

Jhon J. Bravo, Jose L. Herrera (2020)

Archivum Mathematicum

Similarity:

For an integer k 2 , let ( n ) n be the k - generalized Pell sequence which starts with 0 , ... , 0 , 1 ( k terms) and each term afterwards is given by the linear recurrence n = 2 n - 1 + n - 2 + + n - k . In this paper, we find all k -generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ( P n ( 2 ) ) n . ...

Generalizations of Milne’s U ( n + 1 ) q -Chu-Vandermonde summation

Jian-Ping Fang (2016)

Czechoslovak Mathematical Journal

Similarity:

We derive two identities for multiple basic hyper-geometric series associated with the unitary U ( n + 1 ) group. In order to get the two identities, we first present two known q -exponential operator identities which were established in our earlier paper. From the two identities and combining them with the two U ( n + 1 ) q -Chu-Vandermonde summations established by Milne, we arrive at our results. Using the identities obtained in this paper, we give two interesting identities involving binomial...

Towards Bauer's theorem for linear recurrence sequences

Mariusz Skałba (2003)

Colloquium Mathematicae

Similarity:

Consider a recurrence sequence ( x k ) k of integers satisfying x k + n = a n - 1 x k + n - 1 + . . . + a x k + 1 + a x k , where a , a , . . . , a n - 1 are fixed and a₀ ∈ -1,1. Assume that x k > 0 for all sufficiently large k. If there exists k₀∈ ℤ such that x k < 0 then for each negative integer -D there exist infinitely many rational primes q such that q | x k for some k ∈ ℕ and (-D/q) = -1.

On the Lucas sequence equations Vₙ = kVₘ and Uₙ = kUₘ

Refik Keskin, Zafer Şiar (2013)

Colloquium Mathematicae

Similarity:

Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and U n + 1 = P U - Q U n - 1 for n ≥ 1, and V₀ = 2, V₁ = P and V n + 1 = P V - Q V n - 1 for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and V r 1 . We show that there is no integer x such that V = V r V x ² when m ≥ 1 and r is an even integer. Also we completely solve the equation V = V V r x ² for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and...

On the least common multiple of Lucas subsequences

Shigeki Akiyama, Florian Luca (2013)

Acta Arithmetica

Similarity:

We compare the growth of the least common multiple of the numbers u a 1 , . . . , u a n and | u a 1 u a n | , where ( u n ) n 0 is a Lucas sequence and ( a n ) n 0 is some sequence of positive integers.

Bartz-Marlewski equation with generalized Lucas components

Hayder R. Hashim (2022)

Archivum Mathematicum

Similarity:

Let { U n } = { U n ( P , Q ) } and { V n } = { V n ( P , Q ) } be the Lucas sequences of the first and second kind respectively at the parameters P 1 and Q { - 1 , 1 } . In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation x 2 - 3 x y + y 2 + x = 0 , where ( x , y ) = ( U i , U j ) or ( V i , V j ) with i , j 1 . Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

Lucas sequences and repdigits

Hayder Raheem Hashim, Szabolcs Tengely (2022)

Mathematica Bohemica

Similarity:

Let ( G n ) n 1 be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are { U n } and { V n } , respectively. We show that the Diophantine equation G n = B · ( g l m - 1 ) / ( g l - 1 ) has only finitely many solutions in n , m + , where g 2 , l is even and 1 B g l - 1 . Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral...

Padovan and Perrin numbers as products of two generalized Lucas numbers

Kouèssi Norbert Adédji, Japhet Odjoumani, Alain Togbé (2023)

Archivum Mathematicum

Similarity:

Let P m and E m be the m -th Padovan and Perrin numbers respectively. Let r , s be non-zero integers with r 1 and s { - 1 , 1 } , let { U n } n 0 be the generalized Lucas sequence given by U n + 2 = r U n + 1 + s U n , with U 0 = 0 and U 1 = 1 . In this paper, we give effective bounds for the solutions of the following Diophantine equations P m = U n U k and E m = U n U k , where m , n and k are non-negative integers. Then, we explicitly solve the above Diophantine equations for the Fibonacci, Pell and balancing sequences.

On perfect powers in k -generalized Pell sequence

Zafer Şiar, Refik Keskin, Elif Segah Öztaş (2023)

Mathematica Bohemica

Similarity:

Let k 2 and let ( P n ( k ) ) n 2 - k be the k -generalized Pell sequence defined by P n ( k ) = 2 P n - 1 ( k ) + P n - 2 ( k ) + + P n - k ( k ) for n 2 with initial conditions P - ( k - 2 ) ( k ) = P - ( k - 3 ) ( k ) = = P - 1 ( k ) = P 0 ( k ) = 0 , P 1 ( k ) = 1 . In this study, we handle the equation P n ( k ) = y m in positive integers n , m , y , k such that k , y 2 , and give an upper bound on n . Also, we will show that the equation P n ( k ) = y m with 2 y 1000 has only one solution given by P 7 ( 2 ) = 13 2 .

( m , r ) -central Riordan arrays and their applications

Sheng-Liang Yang, Yan-Xue Xu, Tian-Xiao He (2017)

Czechoslovak Mathematical Journal

Similarity:

For integers m > r 0 , Brietzke (2008) defined the ( m , r ) -central coefficients of an infinite lower triangular matrix G = ( d , h ) = ( d n , k ) n , k as d m n + r , ( m - 1 ) n + r , with n = 0 , 1 , 2 , , and the ( m , r ) -central coefficient triangle of G as G ( m , r ) = ( d m n + r , ( m - 1 ) n + k + r ) n , k . It is known that the ( m , r ) -central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = ( d , h ) with h ( 0 ) = 0 and d ( 0 ) , h ' ( 0 ) 0 , we obtain the generating function of its ( m , r ) -central coefficients and give an explicit representation for the ( m , r ) -central Riordan array G ( m , r ) in terms of the Riordan array G ....