- Research
- Open access
- Published:
Sixteen practically solvable systems of difference equations
Advances in Difference Equations volume 2019, Article number: 467 (2019)
Abstract
Closed-form formulas for general solutions to sixteen hyperbolic-cotangent-type systems of difference equations of interest are obtained, showing their practical solvability and completely solving a solvability problem for some concrete values of delays.
1 Introduction
1.1 A little on solvability
Solvability of recurrence relations was started to be studied long time ago [1,2,3]. That the relations are, in fact, difference equations has been also known for a long time [4].
Solvability of linear difference equations with constant coefficients, that is, of the equation
was known to De Moivre [2] (see also [5]). The study was continued by other known scientists (see, e.g., [4, 6]). For some presentations of classical solvability results consult, e.g., [7,8,9,10,11,12,13,14].
In the last two decades the topic re-attracted some interest, although it seems that a considerable part of the results in the topic are not quite original (see, e.g., some of the comments in [15,16,17,18,19]). Nevertheless, the recent investigation opened a door for further studies of related equations and systems (see, e.g., [20,21,22,23] and the references therein).
On the other hand, Papaschinopoulos, Schinas, and their collaborators devoted a part of their investigations to some symmetric-type systems, that is, to those of the form
as well as to some related ones obtained from the systems by modifying the function g in various ways (see, e.g., [24,25,26,27,28,29,30,31,32]). Regarding the solvability of systems, they paid more attention to their invariants (see, e.g., [25,26,27, 29, 31, 32]). Their study on systems of difference equations motivated some other authors to do some research on the related ones (see, e.g., [15, 16, 19, 22, 23, 33,34,35,36,37] and the related references therein). Besides the papers on nonlinear two-dimensional systems of difference equations, there are also some on three-dimensional ones, as well as on systems of higher orders (see, e.g., [16, 29]).
It should be pointed out that since the beginning of the study of solvability of difference equations, many problems have been motivated by concrete applications, which to some extent lasts up to the present time (see, e.g., [3, 4, 6, 8, 9, 13, 38,39,40,41,42,43,44,45,46,47]). It is interesting to note that among the first ones were the problems from combinatorics (see, e.g., [2,3,4, 6]). But recall also that from the ancient times many recurrent relations have been connected to various population models, as it was the case with the Fibonacci model for the growth of a rabbit population (see, e.g., [47]). The main idea in solvability theory is to obtain some formulas for the general solution to a concrete difference equation or a class of difference equations, and based on them to get some information on the long-term behavior of their solutions.
1.2 Results related to the ones presented here
Before we continue, recall some notations. Let \(\mathbb {N}=\{1,2,3,\ldots \}\), \(\mathbb {N}_{0}=\mathbb {N}\cup \{0\}\), \(\mathbb {Z}=-\mathbb {N}\cup \mathbb {N}_{0}\), \(\mathbb {R}\) be the set of reals, and \(\mathbb {C}\) be that of complex numbers. The notation \(s=\overline {l_{1},l_{2}}\), where \(l_{1},l_{2}\in \mathbb {Z}\), \(l_{1}\le l_{2}\), is the same as \(\{s\in \mathbb {Z}: l_{1}\le s\le l_{2}\}\).
The equation
where \(k,l\in \mathbb {N}_{0}\), \(\alpha \in \mathbb {R}\) (or \(\mathbb {C}\)), is one of those which attracted some attention, especially, during the last two decades. Positive solutions to some concrete cases of the equation have been studied by several authors. But it was shown in [48] that the results on the global stability of such solutions are essentially known, since they follow from a result in [49]. For some multi-dimensional extensions of the result in [49], see [50] and [51]. It is easy to see that in (2) we may assume \(\alpha =1\). In this case the right-hand side of (2) has the form of known hyperbolic-cotangent sum formula. As usual, such difference equations are candidates for solvable ones, the fact known for a long time (the observation can be found in the old book [7], and it would not be surprising to find it even in some much earlier sources). A natural way for studying solvability of equation (2) can be found in [52].
The corresponding close-to-symmetric system in the case \(k=0\), \(l=1\), that is, the system
where
whereas \(u_{n}\), \(v_{n}\), \(w_{n}\), \(s_{n}\) are \(x_{n}\) or \(y_{n}\), has been studied recently in [53] and [54]. Systems of this form were studied for the first time in [22].
Quite recently in [55] we have given another solution to the solvability problem for system (3), which is related to the method for solving equation (2) presented in [56]. Maybe more important is that we have also shown therein theoretical solvability of the following generalization of system (3):
where \(k,l\in \mathbb {N}_{0}\),
and each of the sequences \(u_{n}\), \(v_{n}\), \(w_{n}\), \(s_{n}\) is equal to \(x_{n}\) or \(y_{n}\).
We would like also to say that general solutions to the systems investigated in [53,54,55] were presented in terms of the Fibonacci sequence, that is, in terms of the sequence defined by
satisfying the initial conditions \(a_{1}=a_{2}=1\) (see, e.g., [39, 43, 47, 57] for some information on the sequence). Such kind of representations seems to have been quite popular among some authors in the last ten years or so. For some explanations in this direction, see [15]. There we have shown that to some difference equations and systems of difference equations can be naturally associated some linear difference equations with constant coefficients such that some of their solutions can be used in representations of the general solutions to the equations and systems. For example, in [15] it naturally appears the sequence
such that \(a_{0}=0\) and \(a_{1}=1\). For some related results and their applications in representations of general solutions to some classes of difference equations and systems, see also [16,17,18,19].
1.3 What is done in this paper and how
Here, we continue our study in [55] by finding general solutions to the systems of difference equations in (4) in the case \(k=1\) and \(l=2\), complementing the results in [55]. We show that, in the case, the systems are practically solvable. This means that for each of the sixteen systems in (3) there is a finite number of closed-form formulas representing its general solution (for some more explanations related to the notion, as well as for some examples, see [55]). This is done by considerable use of some methods and ideas on product-type difference equations and systems, which can be found, e.g., in the following recent papers: [33,34,35,36,37] (see also the related references therein).
Here we also show that for each of the systems in (3) there are a naturally associated homogeneous linear difference equation with constant coefficients and a specially chosen solution to the linear equation by which the general solution to the system can be represented. Unlike the closed-form formulas presented in [55], this time the associated linear difference equations are not connected to the Fibonacci sequence, at all. The closed-form formulas obtained here show the usual diversity of representations that we have noticed in some previous studies (see, e.g., [15, 16, 19, 33,34,35,36,37]). However, the connectedness of the systems studied here and [55] is through the general homogeneous linear difference equation with constant coefficients.
How is dealt with the systems in (4) in the case \(a=0\) is well known. Namely, in this case the systems are easily solved by some simple changes of variables, which transform them to linear solvable ones (for more details, see [55]). Hence, we omit here studying the case and leave it to the interested reader as a simple exercise (see also [55]).
Let us also mention that the majority of solvable difference equations are solved by using the idea, that is, by using suitable changes of variables which transform them to known solvable ones. Many results of this type, out of the books and papers quoted above, can be found, e.g., in [4, 7,8,9, 15,16,17,18,19, 21,22,23, 33,34,35,36,37, 52,53,54,55, 58].
2 Auxiliary results
Here we present some auxiliary results, which are used in the proofs of the main ones.
The following Lagrange result is well known and can be proved in several ways (see, e.g., [37, 39, 59]).
Lemma 1
Let \(x_{k}\), \(k=\overline {1,m}\), be the roots of the polynomial
where \(b_{m}\ne 0\). Assume that the roots are distinct.
Then
when \(0\le j\le m-2\), and
Special cases of the following interesting, quite useful, and applicable lemma, which should be folklore, have been used in some of our recent papers (see, e.g., [34, 35, 37]). Here we present it in full generality and will frequently use in the rest of the paper.
Lemma 2
Consider equation (1), where \(l\in \mathbb {Z}\), \(a_{j}\in \mathbb {C}\), \(j=\overline {1,m}\), \(a_{m}\ne 0\). Let \(t_{k}\), \(k=\overline {1,m}\), be the roots of the characteristic polynomial
associated with equation (1). Assume that the roots are distinct.
Then the solution to equation (1) such that
is given by
for \(n\ge l-m\).
Proof
By a well-known result from theory of homogeneous linear difference equations with constant coefficients, a general solution to equation (1), in the case when the roots \(t_{k}\), \(k=\overline {1,m}\), of the characteristic polynomial \(p_{m}\) are distinct, has the following form:
where \(c_{k}\), \(k=\overline {1,m}\), are arbitrary constants (see, e.g., [7,8,9, 11,12,13,14]).
Since the sequence \(x_{n}\) defined in (6) has the form in (7), with
it is obviously a solution to equation (1).
On the other hand, by Lemma 1 we see that this solution satisfies the initial conditions given in (5), from which together with the well-known fact that each solution to equation (1) is uniquely defined by m consecutive terms, the lemma follows. □
Remark 1
We would also like to say that we will frequently use here the fact that, when \(a_{m}\ne 0\), every solution to equation (1) is naturally prolonged on the whole domain \(\mathbb {Z}\) by using the following obvious consequence of recurrence relation (1):
Since each solution to equation (1) is uniquely defined by m consecutive members, it follows that the formulas obtained on the domain \(n\ge l\) also hold on \(\mathbb {Z}\). Specially, formula (6) presents the solution to equation (1) with initial conditions (5) not only on the set \(n\ge l\), but also on the whole \(\mathbb {Z}\).
Remark 2
Recall that
for each \(k\in \{1,2,\ldots ,m\}\).
From this and due to the observation in Remark 1, it follows that formula (6) can be also written in the following form:
for every \(n\in \mathbb {Z}\).
3 Main results
Before we present and give proofs of our main results, we first transform the systems studied here to some simpler forms by using some changes of variables, which are naturally imposed.
In order to do this, first note that from the equations in (4) with \(k=1\) and \(l=2\), after some simple calculations, we have that the following two pairs of relations hold:
for \(n\in \mathbb {N}_{0}\), from which it follows that
for \(n\in \mathbb {N}_{0}\).
Bearing in mind that \(u_{n}\), \(v_{n}\), \(w_{n}\), \(s_{n}\) can be \(x_{n}\) or \(y_{n}\), from (9) sixteen different systems are obtained. They are as follows:
for \(n\in \mathbb {N}_{0}\).
Let
for \(n\ge -2\).
Then (10)–(25) respectively become
\(n\in \mathbb {N}_{0}\).
Now we are going to study the solvability of systems (27)–(42). As we have already mentioned, we employ here some methods which have been used to product-type systems and can be found, e.g., in [34,35,36].
3.1 Solution to system (27)
Clearly, in this case we have
Let
Then we have
for \(n\in \mathbb {N}\).
Iterating (45) we have
for \(n\ge 3\), where
Suppose that
for \(k\in \mathbb {N}\setminus \{1\}\) and every \(n\ge k+1\).
where
The inductive argument shows that (46) and (47) hold for every \(k\ge 2\) and \(n\ge k+1\).
Note that from (47) we have
(in fact, (48) holds for every \(n\in \mathbb {Z}\); see Remark 1).
Besides, by using (47), we have
(see, e.g., the corresponding calculations in [33] and [37]).
Letting \(k=n-1\) in (46) and using (47), we get
for \(n\in \mathbb {N}\) (moreover, (50) holds for \(n\ge -2\), which is easily checked by a simple calculation and the use of (49)).
From (43) and (50), it follows that
for \(n\in \mathbb {N}\).
The characteristic equation associated with equation (48) is
Let \(\lambda _{j}\), \(j=\overline {1,3}\), be the roots of polynomial \(P_{3}\). Since the discriminant \(\Delta =23\) of the polynomial is different from zero, it follows that the roots are distinct (recall that if a polynomial of the third order has the form \(Q_{3}(\lambda )=\lambda ^{3}+p\lambda +q\), then the discriminant is given by \(\Delta =4p^{3}+27q^{2}\)). Moreover, since the discriminant is positive, one of the roots is real, whereas the two other ones are complex conjugate. They can be calculated by using known methods (see, e.g., [59]). Since this is a routine thing and we have done similar calculations a few times recently [34, 36], we leave it to the reader.
By Lemma 2, we have that the solution to equation (48) such that
is given by
From the above consideration along with the relations in (26), we see that the following corollary holds.
Corollary 1
Consider system (10) with \(a\ne 0\). Then its general solution is
where \(a_{n}\)is given by (53).
3.2 Solution to system (28)
From the previous case we see that (50) holds. Besides, we also have
From (50), (54), and some calculation, we have
for \(n\in \mathbb {N}_{0}\) and
for \(n\ge -1\).
Further, by using (48) and (49), we have
for \(n\in \mathbb {N}_{0}\).
Employing (57)–(60) in (55) and (56), we obtain
for \(n\in \mathbb {N}_{0}\) and
for \(n\ge -1\).
Hence, (50), (61), and (62) present the general solution to the system of difference equations (28). This consideration along with (26) shows that the following corollary holds.
Corollary 2
Consider system (11) with \(a\ne 0\). Then its general solution is
where \(a_{n}\)is given by (53).
3.3 Solution to system (29)
Note that (50) holds, and we have
for \(n\in \mathbb {N}\), that is,
for \(n\in \mathbb {N}\), \(i=-2,-1,0\).
We have
for \(n\in \mathbb {N}_{0}\),
for \(n\ge -1\), and
for \(n\ge -1\).
Further, by using (48) and (49), we have
Employing (68)–(74) in (65)–(67), we obtain
for \(n\in \mathbb {N}_{0}\),
for \(n\ge -1\), and
for \(n\ge -1\).
Formulas (50), (75)–(77) present the general solution to system (29). This consideration along with (26) shows that the following corollary holds.
Corollary 3
Consider system (12) with \(a\ne 0\). Then its general solution is
where sequence \(a_{n}\)is given by (53).
3.4 Solution to system (30)
Obviously, formula (50) holds, and we have
for \(n\ge -2\).
Therefore, formulas (50) and (78) present the general solution to the system of difference equations (30). This consideration along with (26) shows that the following corollary holds.
Corollary 4
Consider system (13) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\), where \(a_{n}\)is given by (53).
3.5 Solution to system (31)
From the equations in (31) we have
Let
Then
Employing (79) in (81), we have
for \(n\ge 5\), where
Suppose that
and
for \(k\in \mathbb {N}\setminus \{1\}\) and \(n\ge k+3\).
where
for \(k\ge 2\) and every \(n\ge k+4\). The inductive argument shows that (82) and (83) hold for \(2\le k\le n-3\).
From (83) it follows that
(in fact (84) holds for every \(n\in \mathbb {Z}\), see Remark 1) and
If we take \(k=n-4\) in equation (82), which is obtained when n is replaced by \(n-1\), we obtain
for \(n\ge -2\).
From the second equation in (31) and (86), we have
for \(n\ge -1\).
The characteristic polynomial associated with equation (84) is
Since
we have that three roots of \(P_{5}\) coincide with the roots \(\lambda _{j}\), \(j=1,3\), of polynomial (52), whereas \(\lambda _{4,5}= \pm i\).
By Lemma 2, the solution to equation (84) such that \(a_{-k}=0\), \(k=\overline {3,6}\), and \(a_{-2}=1\) is
Formulas (86) and (87) present the general solution to system (31). This consideration along with (26) shows that the following corollary holds.
Corollary 5
Consider system (14) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\)and
for \(n\ge -1\), where \(a_{n}\)is given by (88).
3.6 Solution to system (32)
From (32) we have
So, we have
Hence, by using (50) it follows that
for \(n\in \mathbb {N}_{0}\), where \(a_{n}\) is the solution to equation (48) such that \(a_{-3}=a_{-2}=0\) and \(a_{-1}=1\), and consequently
for \(n\in \mathbb {N}\).
Formulas (90) and (91) are the closed-form formulas for the general solution to system (32). This consideration along with (26) shows that the following corollary holds.
Corollary 6
Consider system (15) with \(a\ne 0\). Then its general solution is
for \(n\in \mathbb {N}_{0}\), and
for \(n\in \mathbb {N}\), where \(a_{n}\)is given by (53).
3.7 Solution to system (33)
Combining the equations in (33), we obtain
Let
Then
for \(n\ge 7\), where
Suppose that
for \(k\in \mathbb {N}\setminus \{1\}\) and every \(n\ge k+5\), and
Then
for \(n\ge k+3\), where
The inductive argument implies that (93) and (94) hold for every \(k,n\in \mathbb {N}\) such that \(2\le k\le n-5\).
From (94) it follows that
(in fact (95) holds for every \(n\in \mathbb {Z}\), see Remark 1) and
If in (93) we take \(k=n-5\), we get
for \(n\ge -2\).
From the first equation in (33) and (97) it follows that
for \(n\ge -2\).
The characteristic polynomial associated with equation (95) is
Let \(t_{j}\), \(j=\overline {1,6}\), be its roots. Then \(t_{j}=\lambda _{j}\), \(j=\overline {1,3}\) (the roots of polynomial (52)), whereas the other three roots of \(P_{6}\) are the roots of the polynomial \(t^{3}+t-1\), which are routinely found (see, e.g., [34, 36, 59]).
So, by Lemma 2, the solution to equation (95) such that \(a_{-k}=0\), \(k=\overline {3,7}\), and \(a_{-2}=1\) is
Formulas (97) and (98) present the general solution to system (33). This consideration along with (26) shows that the following corollary holds.
Corollary 7
Consider system (16) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\), where the sequence \(a_{n}\)is given by (99) and \(b_{n}=a_{n}-a_{n-3}\).
3.8 Solution to system (34)
This system is obtained from system (29) by interchanging letters ζ and η.
Thus, its general solution is
for \(n\in \mathbb {N}_{0}\),
for \(n\ge -1\),
for \(n\ge -1\), and
for \(n\ge -2\).
Formulas (100)–(103) present the general solution to the system of difference equations (34). This consideration along with (26) shows that the following corollary holds.
Corollary 8
Consider system (17) with \(a\ne 0\). Then its general solution is
where \(a_{n}\)is given by (53).
3.9 Solution to system (35)
Combining the equations in (35), we have that the following recurrence relation holds:
for \(n\ge 4\).
Let
Then equation (104) can be written as follows:
Employing (104) in (106), we have
for \(n\ge 6\), where
Similarly as in the case of equation (92), it is proved that
for \(k\in \mathbb {N}\setminus \{1\}\) and \(n\ge k+4\), and that
From (110), we have
(in fact (111) holds for every \(n\in \mathbb {Z}\), see Remark 1) and
Taking \(k=n-4\) in (109), we obtain
for \(n\ge -2\).
Employing (113) in the second equation in (35), it follows that
for \(n\ge -2\).
The roots of the characteristic polynomial
associated with equation (111) are
where \(\lambda _{j}\), \(j=\overline {1,3}\), are the roots of polynomial (52).
By Lemma 2, we see that the solution to equation (111) such that \(a_{-k}=0\), \(k=\overline {2,6}\), and \(a_{-1}=1\) is
This consideration along with (26) shows that the following corollary holds.
Corollary 9
Consider system (18) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\), where the sequence \(a_{n}\)is given by (116) and
3.10 Solution to system (36)
Combining the equations in (36), it follows that the following relation holds:
for \(n\ge 4\).
Let
Since equation (117) is with interlacing indices of order two (see, e.g., [17, 23]), it can be written as follows:
for \(n\ge 2\) and \(i=0,1\).
By using (117) in (119) we have
for \(n\ge 3\), \(i=0,1\), where
As in the case of equation (45), it is proved that
for \(i=0,1\), and
for \(k\in \mathbb {N}\setminus \{1\}\) and every \(n\ge k+1\).
From (121) it follows that
(in fact recurrent relation (122) holds for every \(n\in \mathbb {Z}\), Remark 1), and it is easily shown that
For \(k=n-1\), from (120), we have
for \(n\ge -1\), and
for \(n\ge -1\).
From (36), (124), and (125), it follows that
for \(n\ge -1\), and
for \(n\ge -1\) ((126) and (127) are also obtained from (124) and (125) due to the symmetry of system (36)).
Now note that the characteristic polynomial associated with difference equation (122) is given by
Let \(\widetilde{t}_{j}\), \(j=\overline {1,3}\), be the roots of polynomial \(\widetilde{P}_{3}\) (they are also found in a routine way [34, 36, 59], which we leave to the interested reader).
By using Lemma 2, we see that the solution to equation (122) satisfying the following conditions
is
The above consideration along with the changes of variables in (26) shows that the following corollary holds.
Corollary 10
Consider system (19) with \(a\ne 0\). Then its general solution is
for \(n\ge -1\), where the sequence \(a_{n}\)is given by (128).
Remark 3
Equation (117) can be also solved directly, that is, without reducing it to two non-interlaced difference equations. Namely, let
then equation (117) can be written as follows:
for \(n\ge 4\).
By using (117) in (129) we have
for \(n\ge 6\), where
Similar to equation (104) it is proved that
and
for \(2\le k\le n-4\).
From (131) it is obtained that
(in fact, recurrent relation (132) holds for every \(n\in \mathbb {Z}\), see Remark 1), and we have that
Now note that the characteristic polynomial associated with difference equation (132) is
Since
we see that \(Q_{6}\) is solvable by radicals.
Let \(\widehat{t}_{j}\), \(j=\overline {1,6}\), be the roots of polynomial \(Q_{6}\). Then, clearly, \(\widehat{t}_{j}=\lambda _{j}\), \(j=\overline {1,3}\), where \(\lambda _{j}\), \(j=\overline {1,3}\), are the roots of polynomial (52), whereas the other three roots of \(Q_{6}\) are the roots of the polynomial
which are routinely found (see, e.g., [34, 36, 59]).
So, by Lemma 2, we see that the solution to equation (132) such that
is
From (26), (36), (130) with \(k=n-4\), the recurrent relations in (131), and (133), another set of closed-form formulas for general solution to system (19) is obtained.
3.11 Solution to system (37)
The form of system (37) shows that
Hence,
for \(n\ge 4\).
By using (50) we have
for \(n\in \mathbb {N}\), where \(a_{n}\) is the solution to equation (48) such that \(a_{-3}=a_{-2}=0\) and \(a_{-1}=1\), and consequently
for \(n\in \mathbb {N}\).
It is easy to see that formula (135) holds also for \(n=0\).
Formulas (134) and (135) present the general solution to system (37). This consideration along with (26) shows that the following corollary holds.
Corollary 11
Consider system (20) with \(a\ne 0\). Then its general solution is
for \(n\in \mathbb {N}\)and
for \(n\in \mathbb {N}_{0}\), where \(a_{n}\)is given by (53).
3.12 Solution to system (38)
This system is got from (28) by interchanging letters ζ and η. Hence, its general solution is
for \(n\in \mathbb {N}_{0}\) and
for \(n\ge -1\), and
for \(n\ge -2\).
Formulas (136)–(138) present the general solution to system (38). This consideration along with (26) shows that the following corollary holds.
Corollary 12
Consider system (21) with \(a\ne 0\). Then its general solution is
where \(a_{n}\)is given by (53).
3.13 Solution to system (39)
Combining the equations in (39), we obtain
for \(n\ge 4\).
Let
Then equation (140) can be written as follows:
for \(n\ge 4\).
By using (139) in (141) we have
for \(n\ge 8\), where
Similar to equation (79), we get
and
for \(k\in \mathbb {N}\setminus \{1\}\) and every \(n\ge k+6\).
From (145) we obtain
and
Taking \(k=n-6\) in (144), we have
for \(n\ge -2\).
for \(n\ge -2\).
The characteristic polynomial associated with equation (146) is
If \(t_{j}\), \(j=\overline {1,6}\), are the roots of the polynomial, then clearly \(\widehat{t}_{j}=\lambda _{j}\), \(j=\overline {1,3}\), where \(\lambda _{j}\), \(j=\overline {1,3}\), are the roots of polynomial (52), whereas the other three roots of \(\widehat{P}_{6}\) are the roots of the polynomial \(t^{3}+t+1\), which are routinely found.
In view of Lemma 2 we see that the solution to (146) such that \(a_{-k}=0\), \(k=\overline {4,8}\), and \(a_{-3}=1\) is
Formulas (148) and (149) present the general solution to system (39). This consideration along with (26) shows that the following corollary holds.
Corollary 13
Consider system (22) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\), where the sequence \(a_{n}\)is given by (150) and \(b_{n}=a_{n}+a_{n-1}\).
3.14 Solution to system (40)
System (40) is obtained from (35) by interchanging letters ζ and η. Hence, its general solution is
for \(n\ge -2\) and
for \(n\ge -2\).
Formulas (151) and (152) present the general solution to system (40). This consideration along with (26) shows that the following corollary holds.
Corollary 14
Consider system (23) with \(a\ne 0\). Then its general solution is
for \(n\ge -2\), where the sequence \(a_{n}\)is given by (116) and \(b_{n}=a_{n}+a_{n-1}\).
3.15 Solution to system (41)
System (41) is obtained from (31) by interchanging letters ζ and η. Hence, its general solution is
for \(n\ge -1\) and
for \(n\ge -2\).
Formulas (153) and (154) present the general solution to system (41). This consideration along with (26) shows that the following corollary holds.
Corollary 15
Consider system (24) with \(a\ne 0\). Then its general solution is
for \(n\ge -1\)and
for \(n\ge -2\), where \(a_{n}\)is given by (88).
3.16 Solution to system (42)
This system of difference equations is obtained from system (27) by interchanging letters ζ and η only. Hence, its solution is given by
for \(n\in \mathbb {N}\) and
for \(n\ge -2\).
Formulas (155) and (156) present the general solution to system (42). This consideration along with (26) shows that the following corollary holds.
Corollary 16
Consider system (25) with \(a\ne 0\). Then its general solution is
where \(a_{n}\)is given by (53).
Remark 4
Corollaries 1–16 show that all systems (10)–(25) are practically solvable. This is obviously equivalent with the practical solvability of system (4) when \(k=1\) and \(l=2\), which is one of the results that we wanted to present in this paper.
References
de Moivre, A.: De Fractionibus algebraicis radicalitate immunibus ad fractiones simpliciores reducendis, deque summandis terminis quarumdam serierum aequali intervallo a se distantibus. Philos. Trans. 32, 162–178 (1722) (in Latin)
de Moivre, A.: Miscellanea analytica de seriebus et quadraturis. J. Tonson & J. Watts, Londini (1730) (in Latin)
de Moivre, A.: The Doctrine of Chances, 3rd edn., London (1756)
Laplace, P.S.: Recherches sur l’intégration des équations différentielles aux différences finies et sur leur usage dans la théorie des hasards, Mémoires de l’ Académie Royale des Sciences de Paris 1773, t. VII (1776) (Laplace OEuvres, VIII, 69-197, 1891) (in French)
Euler, L.: Introductio in Analysin Infinitorum, Tomus Primus, Lausannae (1748)
Lagrange, J.-L.: OEuvres, t. II. Gauthier-Villars, Paris (1868) (in French)
Boole, G.: A Treatsie on the Calculus of Finite Differences, 3rd edn. Macmillan Co., London (1880)
Fort, T.: Finite Differences and Difference Equations in the Real Domain. Oxford University Press, London (1948)
Jordan, C.: Calculus of Finite Differences. Chelsea, New York (1956)
Markoff, A.A.: Differenzenrechnung. Teubner, Leipzig (1896) (in German)
Markov, A.A.: Ischislenie Konechnykh Raznostey, 2nd edn. Matezis, Odessa (1910) (in Russian)
Milne-Thomson, L.M.: The Calculus of Finite Differences. Macmillan Co., London (1933)
Mitrinović, D.S., Kečkić, J.D.: Methods for Calculating Finite Sums. Naučna Knjiga, Beograd (1984) (in Serbian)
Nörlund, N.E.: Vorlesungen über Differenzenrechnung. Springer, Berlin (1924) (in German)
Stević, S.: Representation of solutions of bilinear difference equations in terms of generalized Fibonacci sequences. Electron. J. Qual. Theory Differ. Equ. 2014, Article ID 67 (2014)
Stević, S.: Representations of solutions to linear and bilinear difference equations and systems of bilinear difference equations. Adv. Differ. Equ. 2018, Article ID 474 (2018)
Stević, S., Iričanin, B., Kosmala, W., Šmarda, Z.: Note on the bilinear difference equation with a delay. Math. Methods Appl. Sci. 41, 9349–9360 (2018)
Stević, S., Iričanin, B., Kosmala, W., Šmarda, Z.: Representation of solutions of a solvable nonlinear difference equation of second order. Electron. J. Qual. Theory Differ. Equ. 2018, Article ID 95 (2018)
Stević, S., Iričanin, B., Šmarda, Z.: On a symmetric bilinear system of difference equations. Appl. Math. Lett. 89, 15–21 (2019)
Andruch-Sobilo, A., Migda, M.: Further properties of the rational recursive sequence \(x_{n+1}= ax_{n-1}/(b + cx_{n}x_{n-1})\). Opusc. Math. 26(3), 387–394 (2006)
Papaschinopoulos, G., Stefanidou, G.: Asymptotic behavior of the solutions of a class of rational difference equations. Int. J. Difference Equ. 5(2), 233–249 (2010)
Berg, L., Stević, S.: On some systems of difference equations. Appl. Math. Comput. 218, 1713–1718 (2011)
Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: On some solvable difference equations and systems of difference equations. Abstr. Appl. Anal. 2012, Article ID 541761 (2012)
Papaschinopoulos, G., Schinas, C.J.: On a system of two nonlinear difference equations. J. Math. Anal. Appl. 219(2), 415–426 (1998)
Papaschinopoulos, G., Schinas, C.J.: On the behavior of the solutions of a system of two nonlinear difference equations. Commun. Appl. Nonlinear Anal. 5(2), 47–59 (1998)
Papaschinopoulos, G., Schinas, C.J.: Invariants for systems of two nonlinear difference equations. Differ. Equ. Dyn. Syst. 7, 181–196 (1999)
Papaschinopoulos, G., Schinas, C.J.: Invariants and oscillation for systems of two nonlinear difference equations. Nonlinear Anal., Theory Methods Appl. 46, 967–978 (2001)
Papaschinopoulos, G., Schinas, C.J.: Oscillation and asymptotic stability of two systems of difference equations of rational form. J. Differ. Equ. Appl. 7, 601–617 (2001)
Papaschinopoulos, G., Schinas, C.J., Stefanidou, G.: On a k-order system of Lyness-type difference equations. Adv. Differ. Equ. 2007, Article ID 31272 (2007)
Stefanidou, G., Papaschinopoulos, G., Schinas, C.: On a system of max difference equations. Dyn. Contin. Discrete Impuls. Syst., Ser. A Math. Anal. 14(6), 885–903 (2007)
Schinas, C.: Invariants for difference equations and systems of difference equations of rational form. J. Math. Anal. Appl. 216, 164–179 (1997)
Schinas, C.: Invariants for some difference equations. J. Math. Anal. Appl. 212, 281–291 (1997)
Stević, S.: Product-type system of difference equations of second-order solvable in closed form. Electron. J. Qual. Theory Differ. Equ. 2015, Article ID 56 (2015)
Stević, S.: Product-type system of difference equations with complex structure of solutions. Adv. Differ. Equ. 2017, Article ID 140 (2017)
Stević, S.: Solvable product-type system of difference equations whose associated polynomial is of the fourth order. Electron. J. Qual. Theory Differ. Equ. 2017, Article ID 13 (2017)
Stević, S.: Solvability of a product-type system of difference equations with six parameters. Adv. Nonlinear Anal. 8(1), 29–51 (2019)
Stević, S., Iričanin, B., Šmarda, Z.: On a product-type system of difference equations of second order solvable in closed form. J. Inequal. Appl. 2015, Article ID 327 (2015)
Berezansky, L., Braverman, E.: On impulsive Beverton–Holt difference equations and their applications. J. Differ. Equ. Appl. 10(9), 851–868 (2004)
Krechmar, V.A.: A Problem Book in Algebra. Mir, Moscow (1974)
Levy, H., Lessman, F.: Finite Difference Equations. Dover, New York (1992)
Mitrinović, D.S.: Mathematical Induction, Binomial Formula, Combinatorics. Gradjevinska Knjiga, Beograd (1980) (in Serbian)
Mitrinović, D.S.: Matrices and Determinants. Naučna Knjiga, Beograd (1989) (in Serbian)
Mitrinović, D.S., Adamović, D.D.: Sequences and Series. Naučna Knjiga, Beograd (1980) (in Serbian)
Riordan, J.: Combinatorial Identities. Wiley, New York (1968)
Stević, S.: Bounded and periodic solutions to the linear first-order difference equation on the integer domain. Adv. Differ. Equ. 2017, Article ID 283 (2017)
Stević, S.: Bounded solutions to nonhomogeneous linear second-order difference equations. Symmetry 9, Article ID 227 (2017)
Vorobiev, N.N.: Fibonacci Numbers. Birkhäuser, Basel (2002) (Russian original 1950)
Berg, L., Stević, S.: On the asymptotics of some difference equations. J. Differ. Equ. Appl. 18(5), 785–797 (2012)
Kruse, N., Nesemann, T.: Global asymptotic stability in some discrete dynamical systems. J. Math. Anal. Appl. 235, 151–158 (1999)
Papaschinopoulos, G., Schinas, C.J.: Oscillation and asymptotic stability of two systems of difference equations of rational form. J. Differ. Equ. Appl. 7, 601–617 (2001)
Diblik, J., Iričanin, B., Stević, S., Šmarda, Z.: On some symmetric systems of difference equations. Abstr. Appl. Anal. 2013, Article ID 246723 (2013)
Stević, S., Iričanin, B., Kosmala, W.: More on a hyperbolic-cotangent class of difference equations. Math. Methods Appl. Sci. 42, 2974–2992 (2019)
Stević, S., Tollu, D.T.: Solvability and semi-cycle analysis of a class of nonlinear systems of difference equations. Math. Methods Appl. Sci. 42, 3579–3615 (2019)
Stević, S., Tollu, D.T.: Solvability of eight classes of nonlinear systems of difference equations. Math. Methods Appl. Sci. 42, 4065–4112 (2019)
Stević, S.: Solvability of a general class of two-dimensional hyperbolic-cotangent-type systems of difference equations. Adv. Differ. Equ. 2019, Article ID 294 (2019)
Rhouma, M.H.: The Fibonacci sequence modulo π, chaos and some rational recursive equations. J. Math. Anal. Appl. 310, 506–517 (2005)
Alfred, B.U.: An Introduction to Fibonacci Discovery, The Fibonacci Association (1965)
Adamović, D.: Solution to problem 194. Mat. Vesn. 23, 236–242 (1971)
Faddeyev, D.K.: Lectures on Algebra. Nauka, Moscow (1984) (in Russian)
Acknowledgements
The study in this paper is a part of the investigations under the projects III 41025 and III 44006 by the Serbian Ministry of Education and Science.
Availability of data and materials
Not applicable.
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
The author has contributed solely to the writing of this paper. He read and approved the manuscript.
Corresponding author
Ethics declarations
Competing interests
The author declares that he has no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Stević, S. Sixteen practically solvable systems of difference equations. Adv Differ Equ 2019, 467 (2019). https://doi.org/10.1186/s13662-019-2388-6
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-2388-6