1. Introduction and preliminary results
Let n ≥ 0 be an integer. The nth Mersenne number Mn and the nth Mersenne–Lucas number Hn are defined recursively by
and respectively. Note that Mersenne–Lucas numbers are also called as Fermat numbers. The Binet type formulas of these sequences have the form Mn =2n − 1 and Hn = 2n + 1, so Hn = Mn + 2.Mersenne sequence has been studied in many papers, see for example [2, 3, 6, 7, 9]. In the literature, we can find some generalizations of Mersenne numbers, see [4, 10]. In [8], Ochalik and Włoch introduced the generalized Mersenne numbers as follows. Let k ≥ 3 be a fixed integer. For any integer n ≥ 0 let M (k, n) be the nth generalized Mersenne number defined by the second order linear recurrence relation of the form
for n ≥ 2 with M (k, 0) = 0 and M (k, 1) = 1.For n = 0, 1, 2, 3, 4, . . . the generalized Mersenne numbers are 0, 1, k, k2 − k + 1, k3 − 2k2 + 2k, . . .. Moreover, M(3, n) = Mn.
By analogy, we define the generalized Mersenne–Lucas numbers in the following way. Let k ≥ 3 be a fixed integer. For any integer n ≥ 0 let H(k, n) be the nth generalized Mersenne–Lucas number defined by
for n ≥ 2 with H(k, 0) = 2 and H (k, 1) = 3.Then the first few terms of the generalized Mersenne–Lucas sequence are 2, 3, k + 2, k2 − k + 3, k3 − 2k2 + 2k + 2, . . .. It is easily seen that H(3, n) = Hn.
Proof
(By induction on n.) If n = 0 then M0 = 0, H0 = 2. If n = 1 then M1 = 1, H1 = 3. Now assume that for any n ≥ 0, we have H(k, n) = M(k, n)+2 and H(k, n+1) = M(k, n+1)+2. We shall show that H(k, n+2) = M(k, n + 2) + 2. Applying the induction’s hypothesis we obtain
and by the induction’s rule the formula follows.Some identities, properties, combinatorial interpretations and matrix generators of M(k, n) were given in [8] and [11]. In the next part of the paper we use the following results.
Using the fact that H(k, n) = M(k, n) + 2, we can give some properties of generalized Mersenne–Lucas numbers.
The Mersenne numbers and their generalizations have applications also in the theory of hypercomplex numbers. In [5], Daşdemir and Bilgici introduced and studied Mersenne quaternions, Gaussian Mersenne numbers and generalized Mersenne quaternions. In [11], the authors considered the Mersenne hybrid numbers and generalized Mersenne hybrid numbers. In this paper, we use the Mersenne, Mersenne–Lucas numbers and their generalizations in the theory of bihyperbolic numbers.
Hyperbolic numbers are two dimensional number system. Hyperbolic imaginary unit, so-called unipotent, is an element h ≠ ±1 such that h2 = 1. Bihyperbolic numbers are a generalization of hyperbolic numbers. Let ℍ2 be the set of bihyperbolic numbers ζ of the form
where x0, x1, x2, x3 ∈ and j1, j2, j3 ∉ R are operators such thatFrom the above rules the multiplication of bihyperbolic numbers can be made analogously to the multiplication of algebraic expressions. The addition and the subtraction of bihyperbolic numbers is done by adding and subtracting corresponding terms and hence their coefficients. The addition and multiplication on ℍ2 are commutative and associative, (ℍ2, +, ·) is a commutative ring. For the algebraic properties of bihyperbolic numbers, see [1].
Let n ≥ 0 be an integer. The nth bihyperbolic Mersenne number BhMn and the nth bihyperbolic Mersenne–Lucas number BhHn are defined by
respectively, where Mn is the nth Mersenne number, Hn is the nth Mersenne–Lucas number and j1, j2, j3 are units which satisfy (1.9).The nth generalized bihyperbolic Mersenne number we define in the following way
where M(k, n) denotes the nth generalized Mersenne number, defined by (1.1). By analogy, the nth bihyperbolic Mersenne–Lucas number is defined by where H(k, n) denotes the nth generalized Mersenne–Lucas number, defined by (1.2). For k = 3 we have and .Using the above definitions, we can write initial generalized bihyperbolic Mersenne numbers
generalized bihyperbolic Mersenne–Lucas numbers bihyperbolic Mersenne numbers and bihyperbolic Mersenne–Lucas numbers2. Main results
In this section, we present some properties of the generalized bihyperbolic Mersenne and Mersenne–Lucas numbers.
In the same way, using (1.11) and (1.2), we can prove the next theorem.
Next theorems give the Binet formulas for the generalized bihyperbolic Mersenne and Mersenne–Lucas numbers.
Proof
Using (1.4), we have M(k, n + 1) = M(k, n) + (k − 1)n, hence M(k, n + 2) = M(k, n + 1) + (k − 1)n+1 = M(k, n) + (k − 1)n + (k − 1)n+1 and M(k, n + 3) = M(k, n) + (k − 1)n + (k − 1)n+1 + (k − 1)n+2. Thus
Putting (see (1.3)), we obtain the desired formula.
Proof
Using (1.6), (1.7) and proceeding analogously as in the proof of the previous theorem we obtain the desired formula.
For simplicity of notation let A = 1 + j1 + j2 + j3. Using (1.3), (1.6) and (1.12), we can write (2.1) and (2.2) as
and respectively.Using the Binet formula (2.3) and identity (1.3), we can derive the Catalan identity for the generalized bihyperbolic Mersenne numbers.
In the same way, using (2.4) and (1.6), we obtain the Catalan identity for the generalized bihyperbolic Mersenne–Lucas numbers.
For r = 1 we obtain Cassini identities for the generalized bihyperbolic Mersenne and Mersenne–Lucas numbers.
For k = 3 we obtain Catalan and Cassini identities for the bihyperbolic Mersenne and Mersenne–Lucas numbers.
Now we give ordinary generating functions for the generalized bihyperbolic Mersenne and Mersenne–Lucas numbers.
Proof
Assume that the generating function of the generalized bihyperbolic Mersenne number sequence has the form Then
since and the coefficients of tn for n ≥ 2 are equal to zero. Moreover, , .Theorem 2.17
The generating function for the generalized bihyperbolic Mersenne-Lucas number sequence is
Proof
The proof of this theorem is similar to the proof of the previous theorem. Note only that and .
Remark 2.18
The generating function γ(t) for the bihyperbolic Mersenne number sequence {BhMn} is
where BhM0 = j1 + 3j2 + 7j3 and BhM1 − 3BhM0 = 1 − 2j2 − 6j3.Remark 2.19
The generating function η(t) for the bihyperbolic Mersenne–Lucas number sequence {BhHn} is
where BhH0 = 2+3j1 +5j2 +9j3 and BhH1 −3BhH0 = −3−4j1 −6j2 −10j3.At the end, we give the matrix representations of the defined bihyperbolic numbers.
Proof
(By induction on n.) If n = 0 then assuming that the matrix to the power 0 is the identity matrix the result is obvious. Now suppose that for any n ≥ 0 holds
We shall show that
By simple calculations, using induction’s hypothesis we have
which completes the proof.Note that multiplication of bihyperbolic numbers is commutative and determinant properties can be used. For example, calculating determinants in Theorems 2.20–2.21 and Corollaries 2.22–2.23, we can also obtain Cassini identities. Using algebraic operations and matrix algebra could give many other interesting properties of these numbers.
3. Declarations
Funding: This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
Conflict of Interest: The authors declare that they have no conflict of interest.