 Research
 Open Access
 Published:
Some representations of the general solution to a difference equation of additive type
Advances in Difference Equations volume 2019, Article number: 431 (2019)
Abstract
The general solution to the difference equation
where \(a, b, c\in\mathbb{C}\), \(d\in\mathbb{C}\setminus\{0\}\), is presented by using the coefficients, the initial values \(x_{j}\), \(j=\overline{0,2}\), and the solution to the difference equation
satisfying the initial conditions \(y_{3}=y_{2}=y_{1}=0\), \(y_{0}=1\). The representation complements known ones of the general solutions to the corresponding difference equations of the first and second order. Besides, the general representation formula is investigated in detail and refined by using the roots of the characteristic polynomial
of the linear equation. The following cases are considered separately: (1) all the roots of the polynomial are distinct; (2) there is a unique double root of the polynomial; (3) there is a triple root of the polynomial and one simple; (4) there is a quadruple root of the polynomial; (5) there are two distinct double roots of the polynomial.
Introduction
Regarding some notations which are used in this paper, say that we denote the sets of positive, nonnegative, integer, and complex numbers by \({\mathbb {N}}\), \({\mathbb {N}}_{0}\), \({\mathbb {Z}}\), and \({\mathbb {C}}\), respectively. If \(l_{1},l_{2}\in {\mathbb {Z}}\), \(l_{1}\le l_{2}\), then the notation \(l=\overline {l_{1},l_{2}}\), which is frequently used throughout the paper, denotes the set of all \(l\in {\mathbb {Z}}\) satisfying the inequalities \(l_{1}\le l\le l_{2}\). We also use the standard convention \(\prod_{j=k}^{k1}a_{j}=1\), \(k\in {\mathbb {Z}}\).
A method for solving the linear difference equation
where \(k\in {\mathbb {N}}\), \(l\in {\mathbb {Z}}\), \(a_{j}\in {\mathbb {C}}\), \(j=\overline {0,k1}\), \(a_{0}\ne 0\), has been known to de Moivre yet [1]. See also Euler’s book [2] where some old results on solvability can be found. Solvability theory of linear difference equations was developed later, and it became a standard topic of almost any book on difference equations (see, e.g., [3,4,5,6,7,8,9,10]). Equation (1) is practically solvable when \(k\le4\), whereas if \(k>5\) then it is theoretically solvable. These facts are consequences of a wellknown form of the general solution to the equation (see, e.g., [3,4,5,6,7,8,9,10]), as well as of the Abel–Ruffini theorem on solvability of the polynomial equations by radicals [11].
Solvability of equation (1) of the corresponding nonhomogeneous linear difference equation, as well as of the nonhomogeneous linear firstorder difference equation whose coefficients can be nonconstant, is frequently used in pure and applied mathematics as well as in other branches of science. For some recently studied classes of nonlinear difference equations and systems of nonlinear difference equations which have been solved by using one of these equations, see, e.g., [12,13,14,15,16,17]. For some recent applications of their solvability, see, e.g., [18,19,20]. For example, by using solvability methods in [19] and [20], some classes of difference equations are transformed to “integral” forms, which are usually more suitable for studying the existence of bounded or periodic solutions to difference equations than the equations in their original forms.
Employing various changes of variables, many classes of nonlinear difference equations can be transformed to special cases of equation (1), from which solvability of the nonlinear equations can follow.
One of the first of such nonlinear difference equations which appeared in the literature is the following:
where \(\alpha ,\beta ,\gamma ,\delta,z_{0}\in {\mathbb {C}}\) (the bilinear difference equation).
Namely, if \(\alpha \delta\beta \gamma \ne0\) and \(\gamma \ne0\) (these conditions eliminate two simple cases), then the change of variables
transforms equation (2) to
(see, e.g., [3, 10, 21,22,23,24,25]).
For a method which uses an associated twodimensional system of difference equations in solving equation (2), see, e.g., [7] or [26]. For some other results on the difference equation and for some applications of the equation, see, e.g., [3, 12, 25, 27,28,29,30].
As an explanation for the study in this paper, let us note now that the change of variables
transforms equation (2) to
where
which further by the change of variables
where \(y_{0}\) is an arbitrary number different from zero, is transformed to equation (4), that is, to
for \(n\in {\mathbb {N}}_{0}\).
The method for solving equation (5) by using the change of variables (6) is something which is known to any expert. It is much less known that a transformation which transforms equation (7) to equation (5) has been essentially known for more than two centuries and can be found in book [4] by Vincenzo Brunacci. Namely, in nowadays notation, he employed the following change of variables:
from which after some calculation and cancelation, where is tacitly assumed that \(z_{n}\ne0\), \(n\in {\mathbb {N}}_{0}\), equation (7) becomes
and consequently,
Note that the last difference equation is equation (5) with indices shifted forward for one.
Remark 1
Note that the change of variables
transforms equation (7) to equation (5) directly, and that the change of variables is quite natural.
Namely, from relation (6), where \(\widetilde{x}_{n}\) is replaced by \(x_{n}\), it immediately follows that
which is a simple producttype recurrent relation from which relation (9) is easily obtained.
This should be the main reason why Brunacci tried to solve equation (7) by using the change of variables (8). It is also interesting to note that in this way Brunacci “solved” equation (7) in terms of a product of continuous fractions, which is, in fact, a quite complicated representation of general solution to the difference equation.
Now note that the change of variables (8), where \(y_{n}\) is replaced by \(x_{n}\), transforms equation (1) to the following:
for \(n\ge l\).
In [25] we explained why the general solutions to some special cases of the difference equations in (2), as well as the general solutions to some special cases of the corresponding twodimensional systems of difference equations, can be written in terms of the Fibonacci sequence, that is, in terms of the solution to the difference equation
such that
(Many facts related to the Fibonacci sequence and its numerous applications in various branches in mathematics can be found, e.g., in books [31] and [32]; see also [23] and [26] for some basic facts and relations concerning the sequence). Moreover, we have shown that the general solution to equation (2), as well as the general solution to the corresponding twodimensional system of difference equations, can be written in terms of their coefficients, initial values, and the solution to an associated secondorder linear difference equation with constant coefficients satisfying the initial conditions in (11).
Our further investigations on solvability of difference equations and systems of difference equations have shown that these solutions, the solutions to the linear difference equations with constant coefficients of the third order such that \(x_{2}=x_{1}=0\) and \(x_{0}=1\), as well as the solutions to the linear difference equations with constant coefficients of the fourth order such that \(x_{3}=x_{2}=x_{1}=0\) and \(x_{0}=1\), naturally appear in representations of general solutions to several other classes of difference equations and systems of difference equations. For example, they appear in papers [25, 28,29,30] predominately connected to the bilinear difference equations, as well as in the representations of general solutions to the producttype difference equations and systems of difference equations, e.g., in [15, 33,34,35,36,37,38,39] (see also the references therein).
For some other results on solvability of difference equations and systems of difference equations, related topics such as invariants for difference equations and systems, and their applications, see, e.g., [3, 5,6,7, 9, 10, 23, 26, 32, 40,41,42,43,44,45,46,47].
If \(k=3\), equation (10) can be written as follows:
for \(n\in {\mathbb {N}}_{0}\).
Employing the change of variables
it is transformed to
which is clearly solvable.
Motivated, among other things, by some results in [15, 25, 33,34,35,36,37,38,39], recently in [48] we have proved the following theorem extending and theoretically explaining a recent result in the literature.
Theorem 1
Let \(a, b\in {\mathbb {C}}\), \(c\in {\mathbb {C}}\setminus \{0\}\), and let \((t_{n})_{n\ge2}\) be the solution to equation (14) such that
Then every welldefined solution to equation (12) has the following representation:
for \(n\ge1\).
It is a natural problem to obtain the corresponding representation of the general solution to the following difference equation:
where \(a, b, c\in {\mathbb {C}}\), \(d\in {\mathbb {C}}\setminus\{0\}\).
Our aim here is to solve the problem. Besides, we also present more concrete representations of the general solution to equation (17) by using the roots of the polynomial
which is associated with a naturally chosen linear difference equation with constant coefficients.
The following cases are considered separately: (1) all the roots of the polynomial are distinct; (2) there is a unique double root of the polynomial; (3) there is a triple root of the polynomial and one simple; (4) there is a quadruple root of the polynomial; (5) there are two distinct double roots of the polynomial.
Main results
The main results in this paper are stated and proved in this section.
A representation of general solution to equation (17)
Our first result concerns the problem of representing the general solution to equation (17) in terms of the parameters a, b, c, d, initial values, and a specially chosen solution to a linear difference equation with constant coefficients of the fourth order associated with the equation. It complements known representations of the general solutions to the corresponding difference equation of the first order (i.e., of equation (5)), as well as of the second order (i.e., of equation (12)).
Theorem 2
Let \(a, b, c\in {\mathbb {C}}\), \(d\in {\mathbb {C}}\setminus\{0\}\), and \((s_{n})_{n\ge2}\) be the solution to the equation
such that
Then every welldefined solution to equation (17) has the following representation:
for \(n\ge2\).
Proof
We consider the following four cases: (1) \(a\ne0\), (2) \(a=0\), \(b\ne0\), (3) \(a=b=0\), \(c\ne0\), (4) \(a=b=c=0\), separately.
Case \(a\ne0\). The first part of the proof in this case was essentially presented in [49] (see also [36, 38]). Hence, we will present only essential details for the completeness and benefit of the reader.
First note that, by employing (13) in equation (17), it is transformed to equation (19).
Let
Employing (19), where n is replaced by \(n2\), in relation (19), where n is replaced by \(n1\), and using (22), we have
for \(n\ge2\), where
Assume that for an \(l\in {\mathbb {N}}\setminus\{1\}\) and all \(n\ge l\), we have proved
and
Employing relation (19) where n is replaced by \(nl1\) in (25), it follows that
for \(n\ge l+1\), where
Relations (23), (24), (27), (28), and the induction imply that (25) and (26) hold \(2\le l\le n\).
Since \(d\ne0\), (26) can be used to calculate \(\alpha _{l}\), \(\beta _{l}\), \(\gamma _{l}\), and \(\delta_{l}\) for \(l\le0\). Namely, by taking \(l=1,0,1,2\), respectively, it easily follows that (see, e.g., [34, 38] for some details)
The relations in (26) further yield
for \(n\in {\mathbb {Z}}\) (since \(d\ne0\)).
If we take \(l=n\) in (25), we obtain
for \(n\in {\mathbb {N}}_{0}\), from which along with (31)–(33), we get
for \(n\in {\mathbb {N}}_{0}\) (in fact, (35) holds for every \(n\in {\mathbb {Z}}\)).
for \(n\ge2\), from which, along with (29) and (30), as well as the definition of the sequence \(s_{n}\), it follows that
for \(n\ge2\).
Case \(a=0\), \(b\ne0\). Since \(a=0\), we have
Let
Employing (37), where n is replaced by \(n3\), in equality (37), where n is replaced by \(n1\), we obtain
for \(n\ge3\), where
Assume that for an \(l\in {\mathbb {N}}\setminus\{1\}\) and all \(n\ge l+1\), we have proved
and
Then, by using equality (37) where n is replaced by \(nl2\) in (41), we have
where
Relations (39), (40), (43), (44) together with the induction imply that (41) and (42) hold for \(l,n\in {\mathbb {N}}\) such that \(2\le l\le n1\).
Since \(d\ne0\), from (42) it follows that \(\widetilde{\beta {_{l}}}\), \(\widetilde{\gamma }_{l}\), \(\widetilde{\delta}_{l}\), \(\widetilde{\eta}_{l}\) can be calculated for \(l\le0\). Namely, by taking \(l=1,0,1,2,3\), respectively, it easily follows that
(for \(l=1\) are obtained \(\widetilde{\beta {_{0}}}\), \(\widetilde{\gamma }_{0}\), \(\widetilde{\delta}_{0}\), \(\widetilde{\eta}_{0}\), but they are not used further, which is why we have not listed them here).
The relations in (42) further yield
for \(n\in {\mathbb {Z}}\).
From (41) with \(l=n1\), we obtain
for \(n\in {\mathbb {N}}_{0}\).
Employing (47)–(49) in (50), we get
for \(n\in {\mathbb {N}}_{0}\).
From (45) and (46) it follows that \(\widetilde{\beta {_{n}}}\) is the solution to equation (19) with \(a=0\), \(b\ne0\) such that
Hence, from (13) and (51) it follows that (36) also holds in this case.
Case \(a=b=0\ne c\). Since \(a=b=0\), equation (19) is
for \(n\in {\mathbb {N}}_{0}\).
Let
Employing (52), where n is replaced by \(n4\), in equality (52), where n is replaced by \(n1\), we obtain
for \(n\ge4\), where
Assume that for an \(l\in {\mathbb {N}}\setminus\{1\}\) and all \(n\ge l+2\), we have proved
and
Then, by using equality (52) where n is replaced by \(nl3\) in (56), we have
where
From (54), (55), (58), (59), and the induction it follows that (56) and (57) hold for \(l,n\in {\mathbb {N}}\) such that \(2\le l\le n2\).
Since \(d\ne0\), employing the recurrent relations (57), we can calculate \(\widehat{\gamma }_{l}\), \(\widehat{\delta}_{l}\), \(\widehat{\eta}_{l}\), \(\widehat{\zeta}_{l}\) for \(l\le0\) and get
(see, e.g., the corresponding calculations in [34, 37]).
The relations in (57) further yield
for \(n\in {\mathbb {Z}}\).
If we choose \(l=n2\) in (56), we obtain
for \(n\in {\mathbb {N}}_{0}\).
Employing (62)–(64) in (65), it follows that
for \(n\in {\mathbb {N}}_{0}\).
From (60) and (61) we see that \(\widehat{\gamma }_{n}\) is the solution to equation (19) with \(a=b=0\), \(c\ne0\) such that
from which along with (13) and (65) it follows that (36) also holds in this case.
Case \(a=b=c=0\ne d\). Since \(a=b=c=0\), equation (19) is
for \(n\in {\mathbb {N}}_{0}\).
From (67) we have
for \(m\in {\mathbb {N}}_{0}\) and \(i=\overline {0,3}\). It is not difficult to check that (36) holds for the sequence defined in (68).
From (36) we have
for \(n\in {\mathbb {Z}}\), as claimed. □
Remark 2
The case \(a\ne0\) has been essentially treated in [49]. However, the proofs in the other cases, in all of which is \(a=0\), have been omitted there; although, as it is seen in the proof of Theorem 2, they follow the idea of the proof in the case \(a\ne0\). Hence, the proof of Theorem 2 can be regarded as a completion of the proof of Theorem 6 in [49] in the case \(a=0\).
About the roots of polynomial \(P_{4}(\lambda )\)
Here we present the roots of polynomial \(P_{4}\) and some facts related to them.
First, we formulate a wellknown lemma, whose proofs can be found, e.g., in [26, 38, 50].
Lemma 1
Let \(t_{j}\), \(j=\overline {1,k}\) be the roots of the polynomial
such that \(t_{i}\ne t_{j}\), \(i\ne j\), then
Now we discuss the form of the sequence \(s_{n}\) defined in Theorem 2. Equation \(P_{4}(\lambda )=0\) can be written in the form
Further, choose s so that
(see, for example, [50]), that is,
Then (69) is
from which it follows that
or
By using the change of variables
in (70), we have
where
and
A standard procedure for solving cubic equation (75) says that the solutions should be looked for in the form \(\widehat{s}=u+v\), where it is assumed that \(uv=p/3\). Hence, \(u^{3}+v^{3}=q\) and \(u^{3}v^{3}=p^{3}/27\), implying that \(u^{3}\) and \(v^{3}\) are the zeros of \(z^{2}+qzp^{3}/27=0\).
Thus
Let \(p=\Delta_{0}/3\) and \(q=\Delta_{1}/27\), then from (74) and (76) we have
From (72) and (73) and by some calculations, we obtain
where
Multiplicity of the zeros of the polynomial \(P_{4}\) are described in the following lemma (see, e.g., [51]).
Lemma 2
Let polynomial \(P_{4}\) be defined in (18), \(\Delta _{0}\) in (82), \(\Delta _{1}\) in (83), Q in (84), and let \(\Delta =\frac{1}{27}(4\Delta _{0}^{3}\Delta _{1}^{2})\), \(P=8b3a^{2}\), and \(D=64d16b^{2}16a^{2}b16ac3a^{4}\).
Then the following statements hold:

(a)
If \(\Delta \ne0\), then the zeros of \(P_{4}\) are distinct.

(b)
If \(\Delta =0\) and \(P<0\), \(D<0\), \(\Delta _{0}\ne0\), or \(D>0\), or \(P>0\), \(D\ne0\), or \(P>0\), \(Q\ne0\), then exactly two zeros of \(P_{4}\) are equal.

(c)
If \(\Delta=0\), \(\Delta _{0}=0\), and \(D\ne0\), then there is a triple zero of \(P_{4}\) and one simple.

(d)
If \(\Delta=0\), \(D=0\), and if \(P<0\), or \(P>0\) and \(Q=0\), then \(P_{4}\) has two distinct double zeros.

(e)
If \(\Delta=0\), \(D=0\), and \(\Delta _{0}=0\), then all the zeros of \(P_{4}\) are equal to \(a/4\).
Possible forms of the sequence \(s_{n}\)
While formula (21) gives a representation of the general solution to equation (17) in terms of the sequence \(s_{n}\), it does not tell anything about its possible forms. In this section we will describe the forms in terms of the roots \(\lambda _{j}\), \(j=\overline {1,4}\), of polynomial (18).
Case \(\Delta \ne0\). In this case, by Lemma 2(a), we have that the roots \(\lambda _{j}\), \(j=\overline {1,4}\), are distinct. By using Lemma 1 and the general solution to equation (19) in this case, we have proved in [38] (see also [36]) that the following formula holds:
for \(n\ge3\) (in fact, (85) holds for every \(n\in {\mathbb {Z}}\)).
If one of the roots of \(P_{4}\) is one, say \(\lambda _{1}\), then we have
Employing the change of variables
in the equation
it is transformed to
where
We have (see [50]; see also (76))
for \(j=\overline {2,4}\), where ε is a complex root of the equation \(t^{3}=1\), from which along with (87) it follows that
for \(j=\overline {2,4}\).
From the above analysis, we get the following corollary.
Corollary 1
Consider equation (17) with \(a,b,c\in {\mathbb {C}}\) and \(d\in {\mathbb {C}}\setminus\{0\}\). Assume that \(\Delta\ne 0\). Then the following statements are true.

(a)
If \(a+b+c+d\ne1\), then the general solution to equation (17) is given by (21), where sequence \((s_{n})_{n\ge3}\) is given by (85), whereas \(\lambda _{j}\), \(j=\overline {1,4}\), are given by (78)–(81).

(b)
If \(a+b+c+d=1\), then the general solution to equation (17) is given by (21), where sequence \((s_{n})_{n\ge3}\) is given by (85) where \(\lambda _{1}=1\), \(\lambda _{j}\), \(j=\overline {2,4}\), are given by (89).
Remark 3
Note that from (85) we have
for \(n\in {\mathbb {Z}}\). By using (85), (90)–(92) in (21), we get the following representation of the general solution to equation (17) in the case \(\Delta\ne0\):
for \(n\in {\mathbb {Z}}\).
Case \(\Delta =0\) and \(P<0\), \(D<0\), \(\Delta _{0}\ne0\), or \(D>0\), or \(P>0\), \(D\ne0\), or \(P>0\), \(Q\ne0\). By Lemma 2(b) in this case \(P_{4}\) has exactly one double zero. We may assume \(\lambda _{1}=\lambda _{2}\ne \lambda _{j}\), \(j=3,4\). To find the solution satisfying (20), we let \(\lambda _{1}\to \lambda _{2}\) in (85) and get
for \(n\in {\mathbb {Z}}\) (for details, see [36]).
If \(\lambda _{1}=\lambda _{2}=1\), then from (94) we immediately get
for \(n\in {\mathbb {Z}}\).
In this case we have \(a+b+c+d1=43a2bc=0\), \(12\ne6a+2b\), and
from which it follows that
Corollary 2
Consider equation (17) with \(a,b,c\in {\mathbb {C}}\) and \(d\in {\mathbb {C}}\setminus\{0\}\). Assume that \(\Delta =0\) and \(P<0\), \(D<0\), \(\Delta _{0}\ne0\), or \(D>0\), or \(P>0\), \(D\ne0\), or \(P>0\), \(Q\ne0\). Then the following statements hold.

(a)
If \(3a+2b+c\ne4\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (94).

(b)
If \(a+b+c+d1=43a2bc=0\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (95), whereas \(\lambda _{3,4}\) are given by (97).
Case \(\Delta=0\), \(D=0\), and \(P<0\), or \(P>0\) and \(Q=0\). By Lemma 2(d) in this case \(P_{4}\) has two pairs of double zeros. By letting \(\lambda _{3}\to \lambda _{4}\) in (94), it is obtained
for \(n\ge3\) (see [36]).
If \(a+b+c+d=1\), then two of the zeros, say \(\lambda _{1}\) and \(\lambda _{2}\), are equal to 1, and from (98) we obtain
for \(n\ge3\). Besides, from (97) we have
Corollary 3
Consider equation (17) with \(a,b,c\in {\mathbb {C}}\) and \(d\in {\mathbb {C}}\setminus\{0\}\). Assume that \(\Delta =0\), \(D=0\), and \(P<0\), or \(P>0\) and \(Q=0\). Then the following statements hold.

(a)
If \(a+b+c+d\ne1\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (98).

(b)
If \(a+b+c+d=1\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (99), whereas \(\lambda _{3,4}\) are given by (100).
Case \(\Delta=0\), \(\Delta _{0}=0\), and \(D\ne0\). By Lemma 2(c) we have that \(P_{4}\) has a triple zero and one simple. We may assume that \(\lambda _{1}=\lambda _{2}=\lambda _{3}\). In [35] we proved that in this case
for \(n\ge3\).
If \(\lambda _{j}=1\), \(j=\overline {1,3}\), then from (101) it follows that
for \(n\ge3\). Besides, from (96) we have
Corollary 4
Consider equation (17) with \(a,b,c\in {\mathbb {C}}\) and \(d\in {\mathbb {C}}\setminus\{0\}\). Assume that \(\Delta =0\), \(\Delta _{0}=0\), and \(D\ne0\). Then the following statements hold.

(a)
If \(3a+2b+c\ne4\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (101).

(b)
If \(a+b+c+d=1\) and \(3a+2b+c=4\), then the general solution to equation (17) is given by formula (21), where sequence \((s_{n})_{n\ge3}\) is given by (102), whereas \(\lambda _{4}\) is given by (103).
Case \(\Delta=0\), \(D=0\), and \(\Delta _{0}=0\). By Lemma 2(e) we have that all the zeros to \(P_{4}\) are equal to \(a/4\).
The general solution in this case is given by
From this and (20) it follows that \(s_{0}=1=c_{1}\),
Solving the system, we get
Using this in (104), after some calculation, we obtain
for \(n\ge3\).
Corollary 5
Consider equation (17) with \(a,b,c\in {\mathbb {C}}\) and \(d\in {\mathbb {C}}\setminus\{0\}\). Assume that \(\Delta =0\), \(D=0\), and \(\Delta _{0}=0\). Then the general solution to equation (17) is given by formula (21), where the sequence \((s_{n})_{n\ge 3}\) is given by (105).
References
 1.
de Moivre, A.: Miscellanea analytica de seriebus et quadraturis. J. Tonson & J. Watts, London (1730) (in Latin)
 2.
Euler, L.: Introductio in Analysin Infinitorum. Tomus Primus, Lausannae (1748) (in Latin)
 3.
Boole, G.: A Treatsie on the Calculus of Finite Differences, 3rd edn. Macmillan & Co., London (1880)
 4.
Brunacci, V.: Corso di Matematica Sublime, Tomo I, Calcolo delle Differenze Finite e sue Applicazioni. Presso Pietro Allegrini, Firenze (1804) (in Italian)
 5.
Fort, T.: Finite Differences and Difference Equations in the Real Domain. Clarendon, Oxford (1948)
 6.
Jordan, C.: Calculus of Finite Differences. Chelsea, New York (1956)
 7.
Levy, H., Lessman, F.: Finite Difference Equations. Dover, New York (1992)
 8.
Markov, A.A.: Ischislenie Konechnykh Raznostey, 2nd edn. Matezis, Odessa (1910) (in Russian)
 9.
MilneThomson, L.M.: The Calculus of Finite Differences. Macmillan & Co., London (1933)
 10.
Mitrinović, D.S., Kečkić, J.D.: Methods for Calculating Finite Sums. Naučna Knjiga, Beograd (1984) (in Serbian)
 11.
Abel, N.H.: Mémoire sur les équations algébriques, où l’on démontre l’impossibilité de la résolution de l’équation générale du cinquième degré. In: Sylow, L., Lie, S. (eds.) Oeuvres Complètes de Niels Henrik Abel, vol. I, 2nd edn., pp. 28–33 (1881) [1824] (in French)
 12.
Berg, L., Stević, S.: On some systems of difference equations. Appl. Math. Comput. 218, 1713–1718 (2011)
 13.
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)
 14.
Stević, S.: On the system of difference equations \(x_{n}=c_{n}y_{n3}/(a_{n}+b_{n}y_{n1}x_{n2}y_{n3})\), \(y_{n}=\gamma _{n} x_{n3}/(\alpha _{n}+\beta _{n} x_{n1}y_{n2}x_{n3})\). Appl. Math. Comput. 219, 4755–4764 (2013)
 15.
Stević, S.: Solvable subclasses of a class of nonlinear secondorder difference equations. Adv. Nonlinear Anal. 5(2), 147–165 (2016)
 16.
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)
 17.
Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: On the difference equation \(x_{n}=a_{n}x_{nk}/(b_{n}+c_{n}x_{n1}\cdots x_{nk})\). Abstr. Appl. Anal. 2012, Article ID 409237 (2012)
 18.
Stević, S.: Bounded and periodic solutions to the linear firstorder difference equation on the integer domain. Adv. Differ. Equ. 2017, Article ID 283 (2017)
 19.
Stević, S.: Bounded solutions to nonhomogeneous linear secondorder difference equations. Symmetry 9, Article ID 227 (2017)
 20.
Stević, S.: Existence of a unique bounded solution to a linear second order difference equation and the linear first order difference equation. Adv. Differ. Equ. 2017, Article ID 169 (2017)
 21.
Adamović, D.: Solution to problem 194. Mat. Vesn. 23, 236–242 (1971)
 22.
Brand, L.: A sequence defined by a difference equation. Am. Math. Mon. 62(7), 489–492 (1955)
 23.
Mitrinović, D.S., Adamović, D.D.: Sequences and Series. Naučna Knjiga, Beograd (1980) (in Serbian)
 24.
Richardson, C.H.: An Introduction to the Calculus of Finite Differences. Van Nostrand, Toronto (1954)
 25.
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)
 26.
Krechmar, V.A.: A Problem Book in Algebra. Mir, Moscow (1974)
 27.
Berezansky, L., Braverman, E.: On impulsive Beverton–Holt difference equations and their applications. J. Differ. Equ. Appl. 10(9), 851–868 (2004)
 28.
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)
 29.
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)
 30.
Stević, S., Iričanin, B., Šmarda, Z.: On a symmetric bilinear system of difference equations. Appl. Math. Lett. 89, 15–21 (2019)
 31.
Alfred, B.U.: An Introduction to Fibonacci Discovery (1965)
 32.
Vorobiev, N.N.: Fibonacci Numbers. Birkhäuser, Basel (2002)
 33.
Stević, S.: Firstorder producttype systems of difference equations solvable in closed form. Electron. J. Differ. Equ. 2015, Article ID 308 (2015)
 34.
Stević, S.: Producttype system of difference equations of secondorder solvable in closed form. Electron. J. Qual. Theory Differ. Equ. 2015, Article ID 56 (2015)
 35.
Stević, S.: Producttype system of difference equations with complex structure of solutions. Adv. Differ. Equ. 2017, Article ID 140 (2017)
 36.
Stević, S.: Solvable producttype system of difference equations whose associated polynomial is of the fourth order. Electron. J. Qual. Theory Differ. Equ. 2017, Article ID 13 (2017)
 37.
Stević, S.: Solvability of a producttype system of difference equations with six parameters. Adv. Nonlinear Anal. 8(1), 29–51 (2019)
 38.
Stević, S., Iričanin, B., Šmarda, Z.: On a producttype system of difference equations of second order solvable in closed form. J. Inequal. Appl. 2015, Article ID 327 (2015)
 39.
Stević, S., Iričanin, B., Šmarda, Z.: Twodimensional producttype system of difference equations solvable in closed form. Adv. Differ. Equ. 2016, Article ID 253 (2016)
 40.
Mitrinović, D.S.: Matrices and Determinants. Naučna Knjiga, Beograd (1989) (in Serbian)
 41.
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)
 42.
Papaschinopoulos, G., Schinas, C.J.: Invariants for systems of two nonlinear difference equations. Differ. Equ. Dyn. Syst. 7(2), 181–196 (1999)
 43.
Papaschinopoulos, G., Schinas, C.J.: Invariants and oscillation for systems of two nonlinear difference equations. Nonlinear Anal. TMA 46(7), 967–978 (2001)
 44.
Papaschinopoulos, G., Schinas, C.J., Stefanidou, G.: On a korder system of Lynesstype difference equations. Adv. Differ. Equ. 2007, Article ID 31272 (2007)
 45.
Riordan, J.: Combinatorial Identities. Wiley, New York (1968)
 46.
Schinas, C.: Invariants for difference equations and systems of difference equations of rational form. J. Math. Anal. Appl. 216, 164–179 (1997)
 47.
Schinas, C.: Invariants for some difference equations. J. Math. Anal. Appl. 212, 281–291 (1997)
 48.
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)
 49.
Stević, S., Iričanin, B., Kosmala, W., Šmarda, Z.: On some classes of solvable systems of difference equations. Adv. Differ. Equ. 2019, Article ID 39 (2019)
 50.
Faddeyev, D.K.: Lectures on Algebra. Nauka, Moscow (1984) (in Russian)
 51.
Rees, E.L.: Graphical discussion of the roots of a quartic equation. Am. Math. Mon. 29(2), 51–55 (1922)
Acknowledgements
The study in the 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
Affiliations
Contributions
The author has contributed solely to the writing of this paper. He read and approved the manuscript.
Corresponding author
Correspondence to Stevo Stević.
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. Some representations of the general solution to a difference equation of additive type. Adv Differ Equ 2019, 431 (2019). https://doi.org/10.1186/s1366201923650
Received:
Accepted:
Published:
MSC
 39A20
 39A06
 39A45
Keywords
 Thirdorder difference equation
 Solvable difference equation
 Linear difference equation
 Representation of solutions