A note on congruence properties of the generalized bi-periodic Horadam sequence
Elif Tan, Ho-Hon Leung

TL;DR
This paper explores the congruence properties of a generalized bi-periodic Horadam sequence, which varies its recurrence relation based on the parity of n, extending classical sequence analysis.
Contribution
It introduces a generalized bi-periodic Horadam sequence with arbitrary initial conditions and analyzes its congruence properties, expanding understanding of such sequences.
Findings
Identifies specific congruence relations for the sequence
Provides formulas linking sequence terms modulo integers
Extends classical Horadam sequence properties
Abstract
In this paper, we consider a generalization of Horadam sequence {w_n} which is defined by the recurrence w_n = aw_n-1 + cw_n-2; if n is even, w_n = bw_n-1 + cw_n-2; if n is odd with arbitrary initial conditions w_0, w_1 and nonzero real numbers a, b, and c. We investigate some congruence properties of the generalized Horadam sequence {w_n}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Graph Labeling and Dimension Problems · Diverse scientific research topics
A note on congruence
properties of the generalized bi-periodic Horadam sequence
Elif TAN
Department of Mathematics, Ankara University, Ankara, Turkey
and
Ho-Hon Leung
Department of Mathematical Sciences, UAEU, Al-Ain, United Arab Emirates
Abstract.
In this paper, we consider a generalization of Horadam sequence which is defined by the recurrence if is even, if is odd with arbitrary initial conditions and nonzero real numbers and We investigate some congruence properties of the generalized Horadam sequence .
Key words and phrases:
Horadam sequence, generalized Fibonacci sequence, generalized Lucas sequence, congruence
2000 Mathematics Subject Classification:
11B39, 05A15
1. Introduction
The generalized bi-periodic Horadam sequence is defined by the recurrence relation
[TABLE]
with arbitrary initial conditions and nonzero real numbers and . It is emerged as a generalization of the best known sequences in the literature, such as the Horadam sequence, the Fibonacci&Lucas sequence, the -Fibonacci&-Lucas sequence, the Pell&Pell-Lucas sequence, the Jacobsthal& Jacobsthal-Lucas sequence, etc. Similar to the notation of the classical Horadam sequence [4], we write In particular, using this notation, we define and as the generalized bi-periodic Fibonacci sequence and the generalized bi-periodic Lucas sequence, respectively. For the basic properties of the generalized bi-periodic Horadam sequence and some special cases of this sequence, see [3, 16, 9, 7, 1, 11, 13, 14, 15].
On the other hand, it is important to investigate the congruence properties of different integer sequences. Several methods can be applied to produce identities for the Fibonacci and Lucas sequences. For example, Carlitz and Ferns [2] used polynomial identities in conjunction with the Binet formula to generate new identities for these sequences. The method of Carlitz and Ferns was used by several authors to obtain analogous results for the generalized Fibonacci and Lucas sequences, see [17, 6]. On the other hand, Keskin and Siar [10] obtained some number theoretic properties of the generalized Fibonacci and Lucas numbers by using matrix method. Morover, Hsu and Maosen [5] and Zhang [19] applied an operator method to establish some of these properties. Recently, Yang and Zhang [18] have studied some congruence relations for the bi-periodic Fibonacci and Lucas sequences by using operator method. But some of the results that are obtained by the operator method are incorrect. In this study, by using the method of Carlitz and Ferns [2], we give more general identities involving the generalized bi-periodic Horadam sequences and derive some congruence properties of the generalized bi-periodic Horadam numbers. In particular, our results include the corrected version of some of the results in [18].
The outline of this paper as follows: In Section , we give some basic properties of the generalized bi-periodic Horadam sequence. In Section , we give some binomial identities and congruence relations for the generalized bi-periodic Horadam sequence by using the method of Carlitz and Ferns [2].
2. Some preliminary results for the sequence
In this section, we give some basic properties of the bi-periodic Horadam sequences.
The Binet formula of the sequence is
[TABLE]
which can be obtained by [16, Theorem 8]. Here and are the roots of the polynomial that is, and , and is the parity function, i.e., when is even and when is odd. Let assume Also we have and
Lemma 1**.**
For any integer we have
[TABLE]
By using Lemma 1 and the Binet formula of in (2.1), we can easily obtain the Binet formula of the sequence We note that the extended Binet formula for the general case of this sequence was given in [7, Theorem 9]. But here we express the Binet formula of the sequence in a different manner, that is, our and are different from the roots which are used in [7].
Theorem 1**.**
(Binet Formula) For we have
[TABLE]
where and
Proof.
By using Lemma 1 and (2.1), we get the desired result.
By taking initial conditions in Theorem 1, we obtain the Binet formula for the sequence as follows:
[TABLE]
Also by using Lemma 1, we have Thus we get a relation between the generalized bi-periodic Fibonacci and the generalized bi-periodic Lucas numbers as:
[TABLE]
It should be noted that the generalized Lucas sequence in [18] is a special case of the generalized bi-periodic Horadam sequence. That is,
The generating function of the sequence is
[TABLE]
which can be obtained from [7, Theorem 6].
Also we need the following identity which can be found in [15]:
[TABLE]
where
3. Main results
To extend the results in [18, Theorem 4.7, Theorem 4.9, Theorem 4.11, Theorem 4.13], we give the following theorem. Also we assume that and are positive integers.
Theorem 2**.**
For any nonnegative integers and with , we have
[TABLE]
where
Proof.
Similar to the relation for the classical Fibonacci numbers, where is one of the root of the equation we have
[TABLE]
and
[TABLE]
By using the binomial theorem, we have
[TABLE]
[TABLE]
Multiplying both sides of the above equalities by and respectively, and using the Binet formula of we get
[TABLE]
which gives the desired result. It can be expressed as
[TABLE]
We note that it can also be obtained by using Lemma 1 and the identity (2.5) as:
[TABLE]
[TABLE]
By considering the identity we have the following corollary.
Remark 1*.*
When and are all even and in Theorem 2, we obtain the identity
[TABLE]
Thus, the result in [18, Theorem 4.7] can be corrected by multiplying the right side of the equation by The other results in [18, Theorem 4.9, Theorem 4.11, Theorem 4.13] can be corrected similarly.
Corollary 1**.**
For we have
[TABLE]
Now we give a generalization of the Ruggles identity [8] which also generalizes the identities in [18, Theorem 2.2 (3-4)] and [16, Theorem 1]. Then we give a related binomial identity for the generalized bi-periodic Horadam sequence*.*
For and the Ruggles identity [8] is given by
[TABLE]
where and are the Fibonacci and Lucas numbers, respectively. Horadam [4] generalized this result to a general second order recurrence relation
[TABLE]
where with arbitrary initial conditions and The sequence satisfies the same recurrence relation as the sequence but it begins with
A generalization of Ruggles identity can be given in the following lemma.
Lemma 2**.**
For integers and we have
[TABLE]
where is the generalized bi-periodic Horadam sequence and is the generalized bi-periodic Lucas sequence.
Proof.
It can be obtained simply by the Binet formula of
Theorem 3**.**
For nonnegative integers and with , we have
[TABLE]
Proof.
From the Binet formula of and it is clear to see that
[TABLE]
By using the binomial theorem, we have
[TABLE]
Similarly, we have
[TABLE]
Multiplying both sides of the above equalities by and respectively, and using the Binet formula of we get
[TABLE]
Thus, again by using the identity we have
[TABLE]
which gives the desired result.
Remark 2*.*
Since the results in [18, Theorem 4.3, Theorem 4.5] can be corrected by multiplying the right side of the equations by
Corollary 2**.**
For we have
[TABLE]
Note that for and , Corollary 2 gives the results in [18, Corollary 4.2, Corollary 4.4, Corollary 4.6]. Also for the case of generalized Fibonacci and Lucas sequences, it gives the results in [10, 3.3. Corollary].
Lemma 3**.**
For , we have
[TABLE]
where is either or
Proof.
From the Binet formula of and it is clear to see that Thus we have
[TABLE]
Theorem 4**.**
For , we have
[TABLE]
Proof.
From Lemma 3, we have
[TABLE]
Similarly, we have
[TABLE]
By multiplying both sides of the equations (3.1) and (3.2) by and respectively, we get
[TABLE]
Then by using the Binet formula of , we have
[TABLE]
By considering the identity we get the desired result.
If we take in Theorem 4, we get
[TABLE]
which reduces to the identity
[TABLE]
in [18, Theorem 4.15, Theorem 4.17].
Theorem 5**.**
The symbol is defined by For we have
[TABLE]
and
[TABLE]
Proof.
By using Lemma 3 and the multinomial theorem, we obtain the following identities:
[TABLE]
and
[TABLE]
By multiplying both sides in the preceding equalities by and using the Binet formula of we have (3.3) and (3.4), respectively.
We note that for the computational simplicity, the equation (3.4) is more practical than the equation (3.3).
From (3.4), by using the decomposition
[TABLE]
and Theorem 3, we get the following corollary.
Corollary 3**.**
For , we have
[TABLE]
4. Acknowledgement
The first author is grateful to Dr. Mohamed Salim for the arrangement of her visit to United Arab Emirates University (UAEU) in February 2019. It is supported by UAEU UPAR Grant G00002599 (Fund No. 31S314).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bilgici G. Two generalizations of Lucas sequence. Appl. Math. Comput. 245 (2014), 526-538.
- 2[2] Carlitz L., Ferns H. H. Some Fibonacci and Lucas Identities. The Fibonacci Quarterly, 8(1) (1970), 61-73.
- 3[3] Edson M., Yayenie O. A new generalizations of Fibonacci sequences and extended Binet’s Formula. Integers 9 (2009), 639-654.
- 4[4] Horadam A.F. Basic Properties of a Certain Generalized Sequence of Numbers. Fibonacci Quart. 3(3) (1965), 161-76.
- 5[5] Hsu L.C., Jiang M.S. A kind of invertible graphical process for finding reciprocal formulas with applications, Acta Sci. Nat. Univ. Jilinensis 4 (1980) 43-55.
- 6[6] Kilic E., Tan E. More General Identities Involving The Terms Of { W n ( a , b ; p , q ) } 𝑊 𝑛 𝑎 𝑏 𝑝 𝑞 \{Wn(a,b;p,q)\} . Ars Comb. 93 (2009),459-461.
- 7[7] Panario D., Sahin M., Wang Q. A family of Fibonacci-like conditional sequences. Integers, 13(A 78) (2013)
- 8[8] Ruggles I.D. Some Fibonacci results using Fibonacci-type sequences, The Fibonacci Quarterly, 1.2 (1963), 75-80.
