scholarly journals Balancing and Lucas-Balancing Numbers and their Application to Cryptography

2016 ◽  
Vol 5 (1) ◽  
pp. 29-36
Author(s):  
Sujata Swain ◽  
Chidananda Pratihary ◽  
Prasanta Kumar Ray
Keyword(s):  
Finite Number ◽  
Recurrence Relation ◽  
Recurrence Relations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Recursive Relation ◽  
Lucas Numbers ◽  
Counting Problems ◽  
Balancing Numbers

It is well known that, a recursive relation for the sequence  is an equation that relates  to certain of its preceding terms . Initial conditions for the sequence  are explicitly given values for a finite number of the terms of the sequence. The recurrence relation is useful in certain counting problems like Fibonacci numbers, Lucas numbers, balancing numbers, Lucas-balancing numbers etc. In this study, we use the recurrence relations for both balancing and Lucas-balancing numbers and examine their application to cryptography.

scholarly journals On the Sum of Powers of Two k-Fibonacci Numbers which Belongs to the Sequence of k-Lucas Numbers

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Lucas Numbers ◽  
Initial Values ◽  
Lucas Sequence ◽  
Positive Integers

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.

scholarly journals Some Diophantine Problems Related to k-Fibonacci Numbers

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1047
Author(s):  
Pavel Trojovský ◽  
Štěpán Hubálovský
Keyword(s):  
Recurrence Relation ◽  
Diophantine Equations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Recursive Relation ◽  
Initial Values ◽  
Lucas Sequence ◽  
Diophantine Problems ◽  
Positive Integers

Let k ≥ 1 be an integer and denote ( F k , n ) n as the k-Fibonacci sequence whose terms satisfy the recurrence relation F k , n = k F k , n − 1 + F k , n − 2 , with initial conditions F k , 0 = 0 and F k , 1 = 1 . In the same way, the k-Lucas sequence ( L k , n ) n is defined by satisfying the same recursive relation with initial values L k , 0 = 2 and L k , 1 = k . The sequences ( F k , n ) n ≥ 0 and ( L k , n ) n ≥ 0 were introduced by Falcon and Plaza, who derived many of their properties. In particular, they proved that F k , n 2 + F k , n + 1 2 = F k , 2 n + 1 and F k , n + 1 2 − F k , n − 1 2 = k F k , 2 n , for all k ≥ 1 and n ≥ 0 . In this paper, we shall prove that if k > 1 and F k , n s + F k , n + 1 s ∈ ( F k , m ) m ≥ 1 for infinitely many positive integers n, then s = 2 . Similarly, that if F k , n + 1 s − F k , n − 1 s ∈ ( k F k , m ) m ≥ 1 holds for infinitely many positive integers n, then s = 1 or s = 2 . This generalizes a Marques and Togbé result related to the case k = 1 . Furthermore, we shall solve the Diophantine equations F k , n = L k , m , F k , n = F n , k and L k , n = L n , k .

Divisibility properties for Fibonacci and related numbers

2013 ◽  
Vol 97 (540) ◽  
pp. 461-464
Author(s):  
Jawad Sadek ◽  
Russell Euler
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Unified Approach ◽  
Lucas Numbers ◽  
Pell Numbers ◽  
Image Position ◽  
Divisibility Properties

Although it is an old one, the fascinating world of Fibonnaci numbers and Lucas numbers continues to provide rich areas of investigation for professional and amateur mathematicians. We revisit divisibility properties for t0hose numbers along with the closely related Pell numbers and Pell-Lucas numbers by providing a unified approach for our investigation.For non-negative integers n, the recurrence relation defined bywith initial conditionscan be used to study the Pell (Pn), Fibonacci (Fn), Lucas (Ln), and Pell-Lucas (Qn) numbers in a unified way. In particular, if a = 0, b = 1 and c = 1, then (1) defines the Fibonacci numbers xn = Fn. If a = 2, b = 1 and c = 1, then xn = Ln. If a = 0, b = 1 and c = 2, then xn = Pn. If a =b = c = 2, then xn = Qn [1].

scholarly journals On Sums of Cubes of Generalized Fibonacci Numbers: Closed Formulas of Σn k=0 kW3 k and Σn k=1 kW3− k

2020 ◽  
pp. 37-52 ◽  
Author(s):  
Yuksel Soykan
Keyword(s):  
Recurrence Relations ◽  
Fibonacci Numbers ◽  
Second Order ◽  
Lucas Numbers ◽  
Generalized Fibonacci Numbers ◽  
Special Cases

In this paper, closed forms of the sum formulas Σn k=0 kW3 k and Σn k=1 kW3-k for the cubes of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Our work generalize second order recurrence relations.

scholarly journals New Tribonacci recurrence relations and addition formulas

2020 ◽  
Vol 26 (4) ◽  
pp. 164-172
Author(s):  
Kunle Adegoke ◽  
◽  
Adenike Olatinwo ◽  
Winning Oyekanmi ◽  
◽  
...  
Keyword(s):  
Recurrence Relation ◽  
Recurrence Relations ◽  
Simple Relation ◽  
Addition Formula ◽  
Lucas Numbers ◽  
Tribonacci Numbers ◽  
Three Term Recurrence Relation ◽  
Special Case ◽  
Addition Formulas

Only one three-term recurrence relation, namely, W_{r}=2W_{r-1}-W_{r-4}, is known for the generalized Tribonacci numbers, W_r, r\in Z, defined by W_{r}=W_{r-1}+W_{r-2}+W_{r-3} and W_{-r}=W_{-r+3}-W_{-r+2}-W_{-r+1}, where W_0, W_1 and W_2 are given, arbitrary integers, not all zero. Also, only one four-term addition formula is known for these numbers, which is W_{r + s} = T_{s - 1} W_{r - 1} + (T_{s - 1} + T_{s-2} )W_r + T_s W_{r + 1}, where ({T_r})_{r\in Z} is the Tribonacci sequence, a special case of the generalized Tribonacci sequence, with W_0 = T_0 = 0 and W_1 = W_2 = T_1 = T_2 = 1. In this paper we discover three new three-term recurrence relations and two identities from which a plethora of new addition formulas for the generalized Tribonacci numbers may be discovered. We obtain a simple relation connecting the Tribonacci numbers and the Tribonacci–Lucas numbers. Finally, we derive quadratic and cubic recurrence relations for the generalized Tribonacci numbers.

On factorization of the Fibonacci and Lucas numbers using tridiagonal determinants

2012 ◽  
Vol 62 (3) ◽  
Author(s):  
Jaroslav Seibert ◽  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Chebyshev Polynomials ◽  
Fibonacci Numbers ◽  
Second Order ◽  
Tridiagonal Matrix ◽  
Lucas Numbers ◽  
Tridiagonal Matrices ◽  
Fibonacci And Lucas Numbers

AbstractThe aim of this paper is to give new results about factorizations of the Fibonacci numbers F n and the Lucas numbers L n. These numbers are defined by the second order recurrence relation a n+2 = a n+1+a n with the initial terms F 0 = 0, F 1 = 1 and L 0 = 2, L 1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and the Lucas numbers using the Chebyshev polynomials. This method extends the approach used in [CAHILL, N. D.—D’ERRICO, J. R.—SPENCE, J. P.: Complex factorizations of the Fibonacci and Lucas numbers, Fibonacci Quart. 41 (2003), 13–19], and CAHILL, N. D.—NARAYAN, D. A.: Fibonacci and Lucas numbers as tridiagonal matrix determinants, Fibonacci Quart. 42 (2004), 216–221].

scholarly journals A Study on the Sums of Squares of Generalized Fibonacci Numbers: Closed Forms of the Sum Formulas Σn k=0 kxkW2 k and Σn k=1 kxkW2- k

2020 ◽  
pp. 44-67
Author(s):  
Y¨uksel Soykan
Keyword(s):  
Recurrence Relations ◽  
Fibonacci Numbers ◽  
Second Order ◽  
Sums Of Squares ◽  
Lucas Numbers ◽  
Generalized Fibonacci Numbers ◽  
Special Cases

In this paper, closed forms of the sum formulas Σn k=0 kxkW2 k and Σn k=1 kxkW2 -k for the squares of generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Our work generalize second order recurrence relations.

scholarly journals Some properties of the generalized Fibonacci and Lucas numbers

Filomat ◽  
2020 ◽  
Vol 34 (8) ◽  
pp. 2655-2665
Author(s):  
Gospava Djordjevic ◽  
Snezana Djordjevic
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Fibonacci Numbers ◽  
Lucas Numbers ◽  
Generalized Fibonacci Numbers ◽  
Generalized Lucas Numbers ◽  
Fibonacci And Lucas Numbers

In this paper we consider the generalized Fibonacci numbers Fn,m and the generalized Lucas numbers Ln,m. Also, we introduce new sequences of numbers An,m, Bn,m, Cn,m and Dn,m. Further, we find the generating functions and some recurrence relations for these sequences of numbers.

scholarly journals On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

2009 ◽  
Vol 2009 ◽  
pp. 1-21 ◽  
Author(s):  
Tian-Xiao He ◽  
Peter J.-S. Shiue
Keyword(s):  
Recurrence Relation ◽  
Chebyshev Polynomials ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Lucas Numbers ◽  
Polynomial Sequences ◽  
Fibonacci And Lucas Numbers ◽  
Linear Recurrence Relation ◽  
Humbert Polynomials ◽  
General Method

Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2. The applications of the method to the Fibonacci and Lucas numbers, Chebyshev polynomials, the generalized Gegenbauer-Humbert polynomials are also discussed. The derived idea provides a general method to construct identities of number or polynomial sequences defined by linear recurrence relations. The applications using the method to solve some algebraic and ordinary differential equations are presented.

scholarly journals Balancing Numbers and Application

2018 ◽  
Vol 4 ◽  
pp. 137-143
Author(s):  
Ramesh Gautam
Keyword(s):  
Diophantine Equation ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Fibonacci Numbers ◽  
Balancing Numbers

 In this paper, we present about origin of Balancing numbers; It!s connection with Triangular, Pells numbers, and Fibonacci numbers; beginning with connections of balancing numbers with other numbers system, It elaborate the different generating functions of balancing numbers. It also include some amazing recurrence relations; and the application of balancing numbers in solving Diophantine equation.

Sign in / Sign up

Export Citation Format

Share Document