A new approach to define a new integer sequences of Fibonacci type numbers with using of third order linear Recurrence relations

2022 ◽  
Author(s):  
Thiruchinapalli Srinivas ◽  
Katterapalle Sridevi
Keyword(s):  
Recurrence Relations ◽  
Linear Recurrence ◽  
Integer Sequences ◽  
Third Order ◽  
New Approach ◽  
Order Linear

New cube root algorithm based on the third order linear recurrence relations in finite fields

2014 ◽  
Vol 75 (3) ◽  
pp. 483-495 ◽  
Author(s):  
Gook Hwa Cho ◽  
Namhun Koo ◽  
Eunhye Ha ◽  
Soonhak Kwon
Keyword(s):  
Finite Fields ◽  
Recurrence Relations ◽  
Linear Recurrence ◽  
Cube Root ◽  
Third Order ◽  
Order Linear ◽  
The Third

scholarly journals General Linear Recurrence Sequences and Their Convolution Formulas

Axioms ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 132 ◽  
Author(s):  
Paolo Emilio Ricci ◽  
Pierpaolo Natalini
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Second Order ◽  
General Linear ◽  
Linear Recurrence ◽  
Order Linear ◽  
Matrix Polynomials ◽  
Recurrence Sequences ◽  
Straightforward Extension

We extend a technique recently introduced by Chen Zhuoyu and Qi Lan in order to find convolution formulas for second order linear recurrence polynomials generated by 1 1 + a t + b t 2 x . The case of generating functions containing parameters, even in the numerator is considered. Convolution formulas and general recurrence relations are derived. Many illustrative examples and a straightforward extension to the case of matrix polynomials are shown.

scholarly journals A cubic analogue of the RSA cryptosystem

2003 ◽  
Vol 68 (1) ◽  
pp. 21-38 ◽  
Author(s):  
Mohamad Rushdan Md Said ◽  
John Loxton
Keyword(s):  
Recurrence Relation ◽  
Public Key ◽  
Linear Recurrence ◽  
Public Key Cryptosystem ◽  
Third Order ◽  
Rsa Cryptosystem ◽  
Explicit Formulation ◽  
Order Linear ◽  
Euler Totient Function ◽  
Linear Recurrence Relation

In this paper, we investigate a public key cryptosystem which is derived from a third order linear recurrence relation and is analogous to the RSA and LUC cryptosystems. The explicit formulation involves a generalisation of the rule for composition of powers and of the calculus of the Euler totient function which underlie the algebra of the RSA cryptosystem. The security of all these systems appears to be comparable and to depend on the intractability of factorization but the systems do not seem to be mathematically equivalent.

scholarly journals Positivity of third order linear recurrence sequences

2009 ◽  
Vol 157 (15) ◽  
pp. 3239-3248 ◽  
Author(s):  
Vichian Laohakosol ◽  
Pinthira Tangsupphathawat
Keyword(s):  
Linear Recurrence ◽  
Third Order ◽  
Order Linear ◽  
Recurrence Sequences

scholarly journals On the Hybrid Power Mean of Two-Term Exponential Sums and Cubic Gauss Sums

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Shaofan Cao ◽  
Tingting Wang
Keyword(s):  
Exponential Sums ◽  
Recurrence Formula ◽  
Gauss Sums ◽  
Linear Recurrence ◽  
Power Mean ◽  
Third Order ◽  
Trigonometric Sums ◽  
Order Linear ◽  
Hybrid Power ◽  
Hybrid Power Mean

In this paper, an interesting third-order linear recurrence formula is presented by using elementary and analytic methods. This formula is concerned with the calculating problem of the hybrid power mean of a certain two-term exponential sums and the cubic Gauss sums. As an application of this result, some exact computational formulas for one kind hybrid power mean of trigonometric sums are obtained.

Sign in / Sign up

Export Citation Format

Share Document