Add to ORKGIt 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
The balancing numbers are natural numbers n satisfying the Diophantine equation 1 + 2 + 3 + · · · + ...
A brief survey of identities about reciprocal sums of products of elements in a binary recurrence se...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
It is well known that, a recursive relation for the sequence ...
It is well known that, a recursive relation for the sequence ...
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=...
The class of binary recurrence relations is the mother of many important integer sequences. Fibonacc...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
The balancing like sequences are natural generalizations of the balancing sequence with one exceptio...
(n + 2) + · · · + (n + r); r is the balancer corresponding to the balancing number n.The nth balan...
In this thesis, we have studied the balancing and Lucas-balancing numbers for real indices. Also we ...
We know that the Fibonacci numbers are the numbers from Fibonacci sequence. It was discovered by Leo...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityA new method of representing p...
In this study, we define the binomial transforms of balancing and Lucas-balancing polynomials. Also,...
The balancing numbers are natural numbers n satisfying the Diophantine equation 1 + 2 + 3 + · · · + ...
A brief survey of identities about reciprocal sums of products of elements in a binary recurrence se...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...
It is well known that, a recursive relation for the sequence ...
It is well known that, a recursive relation for the sequence ...
Fibonacci numbers are defined as recursively as F_(n+1)=F_n+F_(n-1) with initial conditions F_1=F_2=...
The class of binary recurrence relations is the mother of many important integer sequences. Fibonacc...
A Lucas sequence is a binary recurrence sequences that includes as special cases, the Pell, the asso...
The balancing like sequences are natural generalizations of the balancing sequence with one exceptio...
(n + 2) + · · · + (n + r); r is the balancer corresponding to the balancing number n.The nth balan...
In this thesis, we have studied the balancing and Lucas-balancing numbers for real indices. Also we ...
We know that the Fibonacci numbers are the numbers from Fibonacci sequence. It was discovered by Leo...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Thesis (Ph.D.), Department of Mathematics, Washington State UniversityA new method of representing p...
In this study, we define the binomial transforms of balancing and Lucas-balancing polynomials. Also,...
The balancing numbers are natural numbers n satisfying the Diophantine equation 1 + 2 + 3 + · · · + ...
A brief survey of identities about reciprocal sums of products of elements in a binary recurrence se...
Application of recurrence relations in mathematics and computer science is very widely used. To solv...