We’d like to understand how you use our websites in order to improve them. Register your interest.

# On some classes of solvable systems of difference equations

## Abstract

In a recent paper several periodic systems of difference equations have been presented. We show in an elegant way that all the results therein follow from some known ones. We also show how some extensions of the systems of difference equations can be solved.

## Introduction

Here we use the following standard notations: $${\mathbb{N}}$$ stands for the set of all natural numbers, $${\mathbb{Z}}$$ stands for the set of all integers, for an $$l\in {\mathbb{Z}}$$, $${\mathbb{N}}_{l}$$ is defined as $$\{n\in {\mathbb{Z}}:n\ge l\}$$, $${\mathbb{R}}$$ denotes the set of all real numbers, and $${\mathbb{C}}$$ denotes the set of all complex numbers. Let $$k,l\in {\mathbb{Z}}$$, $$k\le l$$, then the notation $$j= \overline{k,l}$$ denotes the set of all $$j\in {\mathbb{Z}}$$ such that $$k\le j\le l$$.

Solvability of difference equations has been studied for a long time. Basic classes of solvable difference equations and systems were found during the eighteenth century, and since that time the books which contain results on the topic have more or less presented the old original methods or their modifications and refinements which were obtained during the nineteenth century (see, e.g., [1,2,3,4,5,6,7,8,9,10,11]). For some applications of solvability methods of difference equations, see, e.g., [1, 3,4,5, 8, 10,11,12,13,14,15,16,17,18,19].

Since theory of solvability of difference equations has not given new important or effective general methods for investigating solutions to the equations, the study turned to some other directions, such us finding asymptotic behavior or growth rate of their solutions. Some combinations of these methods with solvability methods for difference equations can be found, for example, in the study of the long-term behavior of solutions to the bilinear difference equation

\begin{aligned} x_{n+1}=\frac{ax_{n}+b}{cx_{n}+d},\quad n\in {\mathbb{N}}_{0}, \end{aligned}
(1)

where parameters a, b, c, d and the initial value $$x_{0}$$ are real or complex numbers (see, e.g., [1, 2, 12, 13, 15, 20, 21]), which is a basic example of solvable nonlinear difference equation. Its extension with nonconstant coefficients is an equation of a huge interest since it is equivalent to the homogeneous linear difference equation of second-order. How equation (1) is solved can be found, e.g., in [2, 5, 10, 15, 21, 22]. For some recent results on representations of solutions to equation (1) in terms of Fibonacci-type sequences, see [23, 24], and the references therein. Some basics on Fibonacci sequences can be found, e.g., in  and .

We are witnesses that the area of solvability of difference equations and related ones re-attracts some attention. One of the reasons for the recent interest is the use of computer algebra systems, which can help in finding or guessing closed-form formulas for solutions to some difference equations and systems. The computer algebra systems are certainly useful, but in the majority cases the authors obtain results which are known or easily follow from the known ones (see, e.g., some of our comments in [23, 24, 27,28,29] related to the issue).

Our renewed interest in the topic began in 2004 when S. Stević studied the following difference equation:

$$x_{n+1}=\frac{x_{n-1}}{a+bx_{n-1}x_{n}},\quad n\in {\mathbb{N}}_{0},$$

and gave a theoretical explanation for solvability of the equation. Continuation of the study can be found, e.g., in [30,31,32,33,34,35]. Related methods and ideas have been later used and developed in many papers (see, e.g., [27,28,29, 36] and the references therein). The main idea in the papers is to employ some changes of variables which would reduce the equations/systems studied therein to some well-known solvable ones (quite frequently it is the linear first-order difference equation).

Another area of recent interest is concrete systems of difference equations, with a special interest in symmetric and close-to-symmetric ones. The study of such systems was essentially initiated and popularized by Papaschinopoulos and Schinas (see, e.g., [37,38,39,40,41,42,43,44]). Many of our papers are also devoted to the area (see, e.g., [17, 23, 24, 27, 29, 32, 33, 36] and the references therein). For other related results, including the ones on invariants of difference equations, see, e.g., [39, 40, 43, 45, 46] and the references therein. Let us also mention that some more complex solvable difference equations and systems can be found, e.g., in [17, 33, 47,48,49,50,51], but the idea is essentially the same as in the above-mentioned papers, that is, some connections of studied difference equations and systems to some solvable ones are found.

A vector sequence $$(\vec{x}_{n})_{n\in {\mathbb{N}}_{l}}=(x^{(1)}_{n}, \ldots ,x^{(k)}_{n})_{n\in {\mathbb{N}}_{l}}\in {\mathbb{C}}^{k}$$ is called eventually periodic with period $$p\in {\mathbb{N}}$$ if there is $$n_{0}\in {\mathbb{N}}_{l}$$ such that

$$x^{(i)}_{n+p}=x^{(i)}_{n}$$

for every $$n\ge n_{0}$$ and $$i=\overline{1,k}$$ (see, e.g., [52, 53]). If $$p=1$$, then the sequence is called eventually constant . If $$n_{0}=l$$, then such a sequence is called periodic or more precisely p-periodic. Many authors call both, eventually periodic and periodic sequences, simply as periodic.

In recent paper  periodicity of well-defined solutions to the following systems of difference equations has been studied:

\begin{aligned} &x_{n+1}=\frac{x_{n-k}y_{n-(2k+1)}}{y_{n-(2k+1)}-y_{n-k}},\qquad y_{n+1}=\frac{y _{n-k}x_{n-(2k+1)}}{x_{n-(2k+1)}-x_{n-k}}, \quad n\in {\mathbb{N}}_{0}, \\ \end{aligned}
(2)
\begin{aligned} &x_{n+1}=-\frac{x_{n-k}y_{n-(2k+1)}}{y_{n-(2k+1)}+y_{n-k}},\qquad y_{n+1}=-\frac{y _{n-k}x_{n-(2k+1)}}{x_{n-(2k+1)}+x_{n-k}}, \quad n\in {\mathbb{N}}_{0}, \end{aligned}
(3)
\begin{aligned} &x_{n+1}=\frac{x_{n-k}y_{n-(2k+1)}}{y_{n-(2k+1)}+y_{n-k}},\qquad y_{n+1}=\frac{y _{n-k}x_{n-(2k+1)}}{-x_{n-(2k+1)}+x_{n-k}}, \quad n\in {\mathbb{N}} _{0}, \end{aligned}
(4)
\begin{aligned} &x_{n+1}=\frac{x_{n-k}y_{n-(2k+1)}}{-y_{n-(2k+1)}+y_{n-k}},\qquad y_{n+1}=\frac{y _{n-k}x_{n-(2k+1)}}{x_{n-(2k+1)}+x_{n-k}}, \quad n\in {\mathbb{N}}_{0}, \end{aligned}
(5)

where $$k\in {\mathbb{N}}_{0}$$.

Note that systems (2)–(5) are special cases of the following system of difference equations:

\begin{aligned} x_{n+1}=\frac{x_{n-k}y_{n-(2k+1)}}{ay_{n-(2k+1)}+by_{n-k}},\qquad y _{n+1}=\frac{y_{n-k}x_{n-(2k+1)}}{cx_{n-(2k+1)}+dx_{n-k}}, \quad n \in {\mathbb{N}}_{0}, \end{aligned}
(6)

where $$k\in {\mathbb{N}}_{0}$$, whereas parameters a, b, c, d and initial values $$x_{-j}$$, $$y_{-j}$$, $$j=\overline{0,2k+1}$$, are complex numbers. Namely, system (2) is obtained with $$a=-b=c=-d=1$$, system (3) is obtained with $$a=b=c=d=-1$$, system (4) is obtained with $$a=b=-c=d=1$$, whereas system (5) is obtained with $$-a=b=c=d=1$$.

We first study system (6) and then turn to the special cases of the system in (2)–(5). We show that all the results in  follow from some known ones. We also show how some extensions of the systems of difference equations can be solved.

## On system (6) and the results in 

In this section we first study the structural form of system (6), and then by using the analysis we discuss systems (2)–(5).

### Analysis of the structural form of system (6)

Here we investigate the structural form of system (6).

Since the initial values of the system are $$x_{-j}$$, $$y_{-j}$$, $$j=\overline{0,2k+1}$$, the first terms which are calculated by the equations in (6) are $$x_{1}$$ and $$y_{1}$$. They are obtained for $$n=0$$. We have

$$x_{1}=\frac{x_{-k}y_{-(2k+1)}}{ay_{-(2k+1)}+by_{-k}}\quad \mbox{and} \quad y_{1}= \frac{y_{-k}x_{-(2k+1)}}{cx_{-(2k+1)}+dx_{-k}}.$$

Hence, in calculation of terms $$x_{1}$$ and $$y_{1}$$, only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$ are used.

Let $$n=k+1$$. Then from (6) we have

\begin{aligned} x_{k+2}=\frac{x_{1}y_{-k}}{ay_{-k}+by_{1}}\quad \mbox{and}\quad y_{k+2}= \frac{y _{1}x_{-k}}{cx_{-k}+dx_{1}}. \end{aligned}
(7)

From (7) and bearing in mind that $$x_{1}$$ and $$y_{1}$$ are calculated by using only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$, it follows that in calculation of $$x_{k+2}$$ and $$y_{k+2}$$ also only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$ are used.

Let $$n=2k+2$$. Then from (6) we have

\begin{aligned} x_{2k+3}=\frac{x_{k+2}y_{1}}{ay_{1}+by_{k+2}}\quad \mbox{and}\quad y _{2k+3}= \frac{y_{k+2}x_{1}}{cx_{1}+dx_{k+2}}. \end{aligned}
(8)

From (8) and bearing in mind that $$x_{1}$$, $$y_{1}$$, $$x_{k+2}$$, and $$y_{k+2}$$ are calculated by using only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$, it follows that in calculation of $$x_{2k+3}$$ and $$y_{2k+3}$$ also only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$ are used.

Assume that for some $$m\in {\mathbb{N}}$$ we have proved that $$x_{j(k+1)+1}$$, $$y_{j(k+1)+1}$$, $$-2\le j\le m$$, are calculated by using only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$. From the hypothesis and since

\begin{aligned} x_{(m+1)(k+1)+1} &=\frac{x_{m(k+1)+1}y_{(m-1)(k+1)+1}}{ay_{(m-1)(k+1)+1}+by _{m(k+1)+1}}, \\ y_{(m+1)(k+1)+1} &=\frac{y_{m(k+1)+1}x_{(m-1)(k+1)+1}}{cx_{(m-1)(k+1)+1}+dx _{m(k+1)+1}}, \end{aligned}

it is easy to see that in calculation of $$x_{(m+1)(k+1)+1}$$ and $$y_{(m+1)(k+1)+1}$$ also only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$ are used.

Hence, by induction we have proved that in calculation of all terms of the sequences $$(x_{m(k+1)+1})_{m\ge -2}$$ and $$(y_{m(k+1)+1})_{m\ge -2}$$ also only terms $$x_{-(2k+1)}$$, $$y_{-(2k+1)}$$, $$x_{-k}$$, and $$y_{-k}$$ are used.

The same argument shows that for each fixed $$j\in \{1,2,\ldots ,k+1\}$$, in calculation of all terms of the sequences $$(x_{m(k+1)+j})_{m\ge -2}$$ and $$(y_{m(k+1)+j})_{m\ge -2}$$, only terms $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, and $$y_{j-(k+1)}$$ are used.

Let $$S_{j}$$, $$j=\overline{1,k+1}$$, be the sets defined as follows:

\begin{aligned} S_{j}:=\bigl\{ (k+1)m+j:m\ge -2\bigr\} ,\quad j=\overline{1,k+1}. \end{aligned}
(9)

It is easy to see that

\begin{aligned} S_{i}\cap S_{j}=\emptyset ,\quad i\ne j, \end{aligned}
(10)

and

\begin{aligned} \bigcup_{j=1}^{k+1}S_{j}={ \mathbb{N}}_{-(2k+1)}. \end{aligned}
(11)

Equality (10) implies that when $$i\ne j$$, the sequences $$(x_{m(k+1)+j}, y_{m(k+1)+j})_{m\ge -2}$$ and $$(x_{m(k+1)+i}, y_{m(k+1)+i})_{m \ge -2}$$ are independent of each other (i.e., not connected at all) since the sets of indices are disjoint, while (11) means that the union of the sequences $$(x_{m(k+1)+j})_{m\ge -2}$$, $$j= \overline{1,k+1}$$, forms the whole sequence $$(x_{n})_{n\ge -(2k+1)}$$, whereas the union of the sequences $$(y_{m(k+1)+j})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, forms the whole sequence $$(y_{n})_{n\ge -(2k+1)}$$. Hence, the sequences $$(x_{m(k+1)+j},y_{m(k+1)+j})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, form a partition of the sequence $$(x_{n}, y_{n})_{n \ge -(2k+1)}$$.

Let

\begin{aligned} x_{m}^{(j)} &:=x_{(k+1)m+j}, \end{aligned}
(12)
\begin{aligned} y_{m}^{(j)} &:=y_{(k+1)m+j}, \end{aligned}
(13)

for $$m\ge -2$$, where $$j=\overline{1,k+1}$$.

Then system (6) can be written as

\begin{aligned} x_{m+1}^{(j)}=\frac{x_{m}^{(j)}y_{m-1}^{(j)}}{ay_{m-1}^{(j)}+by_{m} ^{(j)}},\qquad y_{m+1}^{(j)}= \frac{y_{m}^{(j)}x_{m-1}^{(j)}}{cx_{m-1} ^{(j)}+dx_{m}^{(j)}},\quad m\ge -1, \end{aligned}
(14)

for $$j\in \{1,\ldots ,k+1\}$$.

From this it follows that the sequences $$(x_{m}^{(j)},y_{m}^{(j)})_{m \ge -2}$$, $$j=\overline{1,k+1}$$, are $$k+1$$ independent solutions to the following second-order system of difference equations:

\begin{aligned} \widehat{x}_{m+1}=\frac{\widehat{x}_{m}\widehat{y}_{m-1}}{a \widehat{y}_{m-1}+b\widehat{y}_{m}},\qquad \widehat{y}_{m+1}= \frac{\widehat{y}_{m}\widehat{x}_{m-1}}{c\widehat{x}_{m-1}+d\widehat{x}_{m}}, \quad m\ge -1, \end{aligned}
(15)

with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, and $$y_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively. Hence, system (6) is a system of difference equations with interlacing indices . If such a system/equation is reduced to l systems/equations, which are not all systems/equations with interlacing indices, we say that the system/equation is a system/equation with interlacing indices of order l.

It has been recently shown in  that system (15) is solvable, where also the long-term behavior of its solutions has been described in detail in many cases. Hence, the long-term behavior of solutions to system (6) practically directly follows from the long-term behavior of solutions to system (15).

### On the results on systems (2)–(5) quoted in 

Here we discuss in detail the results quoted in .

The first result quoted in  is the following theorem, which was proved by a long calculatory-inductive argument.

### Theorem 1

Let $$(x_{n}, y_{n})_{n\ge -(2k+1)}$$ be a well-defined solution to system (2). Then the following statements hold.

1. (i)

Sequences $$(x_{n})_{n\ge -(2k+1)}$$ and $$(y_{n})_{n\ge -(2k+1)}$$ are periodic with period $$6(k+1)$$.

2. (ii)

We have

\begin{aligned} &x_{6(k+1)m+l}= \textstyle\begin{cases} \frac{x_{l-k-1}y_{l-2k-2}}{y_{l-2k-2}-y_{l-k-1}} , & 1\le l\le k+1, \\ \frac{y_{l-3k-3}(-x_{l-3k-3}+x_{l-2k-2})}{y_{l-3k-3}-y_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{y_{l-3k-3}(-x_{l-4k-4}+x_{l-3k-3})}{y_{l-4k-4}-y_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{y_{l-4k-4}x_{l-5k-5}}{-y_{l-5k-5}+y_{l-4k-4}}, & 3k+4\le l \le 4k+4, \\ x_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \\ &y_{6(k+1)m+l}= \textstyle\begin{cases} \frac{y_{l-k-1}x_{l-2k-2}}{x_{l-2k-2}-x_{l-k-1}} , & 1\le l\le k+1, \\ \frac{x_{l-3k-3}(-y_{l-3k-3}+y_{l-2k-2})}{x_{l-3k-3}-x_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{x_{l-3k-3}(-y_{l-4k-4}+y_{l-3k-3})}{x_{l-4k-4}-x_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{x_{l-4k-4}y_{l-5k-5}}{-x_{l-5k-5}+x_{l-4k-4}}, & 3k+4\le l \le 4k+4, \\ y_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \end{aligned}

for $$m\in {\mathbb{N}}_{0}$$.

In [29, Theorem 4] (see also Example 4 therein for details) it was proved that every well-defined solution to system (15) with $$a=-b=c=-d=1$$ is six-periodic. Bearing in mind this fact, as well as the above consideration which shows that the sequences defined in (12) and (13) are $$k+1$$ independent solutions to the system, it immediately follows that for every well-defined solution to system (2) the sequences $$(x_{n})_{n\ge -(2k+1)}$$ and $$(y_{n})_{n\ge -(2k+1)}$$ are periodic with period $$6(k+1)$$. So, Theorem 1(i) is a very simple consequence of known results.

Part (ii) is a simple consequence of the independence of solutions $$(x_{m}^{(j)},y_{m}^{(j)})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, to the corresponding non-interlacing system (15), and the following equalities, which are verified by simple calculation (they hold for every well-defined solution $$(\widehat{x}_{m},\widehat{y}_{m})_{m\ge -2}$$ to system (15))

\begin{aligned} &\widehat{x}_{0} =\frac{\widehat{x}_{-1}\widehat{y}_{-2}}{\widehat{y} _{-2}-\widehat{y}_{-1}}, \end{aligned}
(16)
\begin{aligned} &\widehat{x}_{1} =-\frac{\widehat{y}_{-2}(\widehat{x}_{-2}- \widehat{x}_{-1})}{\widehat{y}_{-2}-\widehat{y}_{-1}}, \end{aligned}
(17)
\begin{aligned} &\widehat{x}_{2} =-\frac{\widehat{y}_{-1}(\widehat{x}_{-2}- \widehat{x}_{-1})}{\widehat{y}_{-2}-\widehat{y}_{-1}}, \end{aligned}
(18)
\begin{aligned} &\widehat{x}_{3} =-\frac{\widehat{x}_{-2}\widehat{y}_{-1}}{ \widehat{y}_{-2}-\widehat{y}_{-1}}, \end{aligned}
(19)
\begin{aligned} &\widehat{x}_{4} =\widehat{x}_{-2}, \end{aligned}
(20)
\begin{aligned} &\widehat{x}_{5} =\widehat{x}_{-1}, \end{aligned}
(21)

and due to the symmetry of system (15)

\begin{aligned} &\widehat{y}_{0} =\frac{\widehat{y}_{-1}\widehat{x}_{-2}}{\widehat{x} _{-2}-\widehat{x}_{-1}}, \end{aligned}
(22)
\begin{aligned} &\widehat{y}_{1} =-\frac{\widehat{x}_{-2}(\widehat{y}_{-2}- \widehat{y}_{-1})}{\widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(23)
\begin{aligned} &\widehat{y}_{2} =-\frac{\widehat{x}_{-1}(\widehat{y}_{-2}- \widehat{y}_{-1})}{\widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(24)
\begin{aligned} &\widehat{y}_{3} =-\frac{\widehat{y}_{-2}\widehat{x}_{-1}}{ \widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(25)
\begin{aligned} &\widehat{y}_{4} =\widehat{y}_{-2}, \end{aligned}
(26)
\begin{aligned} &\widehat{y}_{5} =\widehat{y}_{-1}, \end{aligned}
(27)

where $$\widehat{x}_{-2}$$, $$\widehat{y}_{-2}$$, $$\widehat{x}_{-1}$$, and $$\widehat{y}_{-1}$$ are replaced with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, and $$y_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively.

The second result in  is the following theorem, for which it was only said that it is proved similarly to Theorem 1 (by an inductive argument).

### Theorem 2

Let $$(x_{n}, y_{n})_{n\ge -(2k+1)}$$ be a well-defined solution to system (3). Then the following statements hold.

1. (i)

Sequences $$(x_{n})_{n\ge -(2k+1)}$$ and $$(y_{n})_{n\ge -(2k+1)}$$ are periodic with period $$6(k+1)$$.

2. (ii)

We have

\begin{aligned} &x_{6(k+1)m+l}= \textstyle\begin{cases} -\frac{x_{l-k-1}y_{l-2k-2}}{y_{l-2k-2}+y_{l-k-1}} , & 1\le l\le k+1, \\ \frac{y_{l-3k-3}(x_{l-3k-3}+x_{l-2k-2})}{y_{l-3k-3}+y_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{y_{l-3k-3}(x_{l-4k-4}+x_{l-3k-3})}{y_{l-4k-4}+y_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ -\frac{y_{l-4k-4}x_{l-5k-5}}{y_{l-5k-5}+y_{l-4k-4}}, & 3k+4\le l \le 4k+4, \\ x_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \\ &y_{6(k+1)m+l}= \textstyle\begin{cases} -\frac{y_{l-k-1}x_{l-2k-2}}{x_{l-2k-2}+x_{l-k-1}} , & 1\le l\le k+1, \\ \frac{x_{l-3k-3}(y_{l-3k-3}+y_{l-2k-2})}{x_{l-3k-3}+x_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{x_{l-3k-3}(y_{l-4k-4}+y_{l-3k-3})}{x_{l-4k-4}+x_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ -\frac{x_{l-4k-4}y_{l-5k-5}}{x_{l-5k-5}+x_{l-4k-4}}, & 3k+4\le l \le 4k+4, \\ y_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \end{aligned}

for $$m\in {\mathbb{N}}_{0}$$.

Since system (3) is a special case of system (6), then similar to (12)–(15), we see that the system is equivalent to $$k+1$$ independent systems of the following form:

\begin{aligned} \widehat{x}_{m+1}=\frac{\widehat{x}_{m}\widehat{y}_{m-1}}{- \widehat{y}_{m-1}-\widehat{y}_{m}},\qquad \widehat{y}_{m+1}= \frac{ \widehat{y}_{m}\widehat{x}_{m-1}}{-\widehat{x}_{m-1}-\widehat{x}_{m}}, \quad m\ge -1. \end{aligned}
(28)

By using the change of variables

\begin{aligned} \widehat{x}_{m}=(-1)^{m}\widetilde{x}_{m},\qquad \widehat{y}_{m}=(-1)^{m} \widetilde{y}_{m},\quad m \ge -2, \end{aligned}
(29)

in (28), it easily follows that

\begin{aligned} \widetilde{x}_{m+1}=\frac{\widetilde{x}_{m}\widetilde{y}_{m-1}}{ \widetilde{y}_{m-1}-\widetilde{y}_{m}},\qquad \widetilde{y}_{m+1}= \frac{ \widetilde{y}_{m}\widetilde{x}_{m-1}}{\widetilde{x}_{m-1}- \widetilde{x}_{m}},\quad m\ge -1. \end{aligned}
(30)

Using again Theorem 4 in , we see that every well-defined solution to system (30) is six-periodic, from which along with (29) it follows that every well-defined solution to system (28) is six-periodic. Hence, we have that every well-defined solution to system (3) is periodic with period $$6(k+1)$$. So, Theorem 2(i) is also a very simple consequence of known results.

Part (ii) is a simple consequence of the independence of solutions $$(x_{m}^{(j)},y_{m}^{(j)})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, to system (30), and the following equalities for terms $$\widehat{x}_{j}$$, $$\widehat{y}_{j}$$, $$j=\overline{0,5}$$, where $$\widehat{x}_{-2}$$, $$\widehat{y}_{-2}$$, $$\widehat{x}_{-1}$$, and $$\widehat{y}_{-1}$$ are replaced with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, and $$y_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively. Note that due to (29) and (16)–(21), it is not necessary to calculate $$\widehat{x}_{j}$$, $$j=\overline{0,5}$$, directly. Namely, by using the equalities, we have

\begin{aligned} &\widehat{x}_{0} =\widetilde{x}_{0}=\frac{\widetilde{x}_{-1} \widetilde{y}_{-2}}{\widetilde{y}_{-2}-\widetilde{y}_{-1}}=- \frac{ \widehat{x}_{-1}\widehat{y}_{-2}}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(31)
\begin{aligned} &\widehat{x}_{1} =-\widetilde{x}_{1}=\frac{\widetilde{y}_{-2}( \widetilde{x}_{-2}-\widetilde{x}_{-1})}{\widetilde{y}_{-2}- \widetilde{y}_{-1}}= \frac{\widehat{y}_{-2}(\widehat{x}_{-2}+ \widehat{x}_{-1})}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(32)
\begin{aligned} &\widehat{x}_{2} =\widetilde{x}_{2}=-\frac{\widetilde{y}_{-1}( \widetilde{x}_{-2}-\widetilde{x}_{-1})}{\widetilde{y}_{-2}- \widetilde{y}_{-1}}= \frac{\widehat{y}_{-1}(\widehat{x}_{-2}+ \widehat{x}_{-1})}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(33)
\begin{aligned} &\widehat{x}_{3} =-\widetilde{x}_{3}=\frac{\widetilde{x}_{-2} \widetilde{y}_{-1}}{\widetilde{y}_{-2}-\widetilde{y}_{-1}}=- \frac{ \widehat{x}_{-2}\widehat{y}_{-1}}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(34)
\begin{aligned} &\widehat{x}_{4} =\widetilde{x}_{4}=\widetilde{x}_{-2}= \widehat{x} _{-2}, \end{aligned}
(35)
\begin{aligned} &\widehat{x}_{5} =-\widetilde{x}_{5}=- \widetilde{x}_{-1}=\widehat{x} _{-1}. \end{aligned}
(36)

Since system (28) is symmetric, from (31)–(36) we directly obtain

\begin{aligned} &\widehat{y}_{0} =-\frac{\widehat{y}_{-1}\widehat{x}_{-2}}{\widehat{x} _{-2}+\widehat{x}_{-1}}, \end{aligned}
(37)
\begin{aligned} &\widehat{y}_{1} =\frac{\widehat{x}_{-2}(\widehat{y}_{-2}+\widehat{y} _{-1})}{\widehat{x}_{-2}+\widehat{x}_{-1}}, \end{aligned}
(38)
\begin{aligned} &\widehat{y}_{2} =\frac{\widehat{x}_{-1}(\widehat{y}_{-2}+\widehat{y} _{-1})}{\widehat{x}_{-2}+\widehat{x}_{-1}}, \end{aligned}
(39)
\begin{aligned} &\widehat{y}_{3} =-\frac{\widehat{y}_{-2}\widehat{x}_{-1}}{ \widehat{x}_{-2}+\widehat{x}_{-1}}, \end{aligned}
(40)
\begin{aligned} &\widehat{y}_{4} =\widehat{y}_{-2}, \end{aligned}
(41)
\begin{aligned} &\widehat{y}_{5} =\widehat{y}_{-1}. \end{aligned}
(42)

The next two results quoted in [46, Corollary 4.1] are the following theorems, for which it was also only said that they can be proved similarly to Theorem 1.

### Theorem 3

Let $$(x_{n}, y_{n})_{n\ge -(2k+1)}$$ be a well-defined solution to system (4). Then the following statements hold.

1. (i)

Sequences $$(x_{n})_{n\ge -(2k+1)}$$ and $$(y_{n})_{n\ge -(2k+1)}$$ are periodic with period $$6(k+1)$$.

2. (ii)

We have

\begin{aligned} &x_{6(k+1)m+l}= \textstyle\begin{cases} \frac{x_{l-k-1}y_{l-2k-2}}{y_{l-2k-2}+y_{l-k-1}} , & 1\le l\le k+1, \\ \frac{y_{l-3k-3}(-x_{l-3k-3}+x_{l-2k-2})}{y_{l-3k-3}+y_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{y_{l-3k-3}(x_{l-4k-4}-x_{l-3k-3})}{y_{l-4k-4}+y_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{y_{l-4k-4}x_{l-5k-5}}{y_{l-5k-5}+y_{l-4k-4}}, & 3k+4\le l\le 4k+4, \\ x_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \\ &y_{6(k+1)m+l}= \textstyle\begin{cases} \frac{y_{l-k-1}x_{l-2k-2}}{-x_{l-2k-2}+x_{l-k-1}} , & 1\le l\le k+1, \\ \frac{x_{l-3k-3}(y_{l-3k-3}+y_{l-2k-2})}{x_{l-3k-3}-x_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{x_{l-3k-3}(y_{l-4k-4}+y_{l-3k-3})}{-x_{l-4k-4}+x_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{x_{l-4k-4}y_{l-5k-5}}{x_{l-5k-5}-x_{l-4k-4}}, & 3k+4\le l\le 4k+4, \\ y_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \end{aligned}

for $$m\in {\mathbb{N}}_{0}$$.

Since equation (4) is a special case of equation (6), then similar to (12)–(15), we see that the system is equivalent to $$k+1$$ independent systems of the following form:

\begin{aligned} \widehat{x}_{m+1}=\frac{\widehat{x}_{m}\widehat{y}_{m-1}}{\widehat{y} _{m-1}+\widehat{y}_{m}},\qquad \widehat{y}_{m+1}= \frac{\widehat{y}_{m} \widehat{x}_{m-1}}{-\widehat{x}_{m-1}+\widehat{x}_{m}},\quad m\ge -1. \end{aligned}
(43)

By using the change of variables

\begin{aligned} \widehat{y}_{m}=(-1)^{m}\widetilde{y}_{m},\quad m \ge -2, \end{aligned}
(44)

in (43), it easily follows that

\begin{aligned} \widehat{x}_{m+1}=\frac{\widehat{x}_{m}\widetilde{y}_{m-1}}{ \widetilde{y}_{m-1}-\widetilde{y}_{m}},\qquad \widetilde{y}_{m+1}= \frac{ \widetilde{y}_{m} \widehat{x}_{m-1}}{\widehat{x}_{m-1}-\widehat{x} _{m}},\quad m\ge -1. \end{aligned}
(45)

Using Theorem 4 in  we see that every well-defined solution to system (45) is six-periodic, from which along with (44) it follows that every well-defined solution to system (43) is six-periodic. Hence, every well-defined solution to system (4) is $$6(k+1)$$-periodic. So, Theorem 3(i) is also a simple consequence of known results.

Part (ii) is a simple consequence of the independence of solutions $$(x_{m}^{(j)},y_{m}^{(j)})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, to system (45) and the following equalities for terms $$x_{j}$$, $$y_{j}$$, $$j=\overline{0,5}$$, where $$\widehat{x}_{-2}$$, $$\widehat{y}_{-2}$$, $$\widehat{x}_{-1}$$, and $$\widehat{y}_{-1}$$ are replaced with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, and $$y_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively. To get $$\widehat{x}_{j}$$ and $$\widehat{y}_{j}$$, $$j=\overline{0,5}$$, we can simply use (44) and (16)–(27). Namely, we have

\begin{aligned} &\widehat{x}_{0} =\frac{\widehat{x}_{-1}\widetilde{y}_{-2}}{ \widetilde{y}_{-2}-\widetilde{y}_{-1}}=\frac{\widehat{x}_{-1} \widehat{y}_{-2}}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(46)
\begin{aligned} &\widehat{x}_{1} =-\frac{\widetilde{y}_{-2}(\widehat{x}_{-2}- \widehat{x}_{-1})}{\widetilde{y}_{-2}-\widetilde{y}_{-1}}=\frac{ \widehat{y}_{-2}(-\widehat{x}_{-2}+\widehat{x}_{-1})}{\widehat{y}_{-2}+ \widehat{y}_{-1}}, \end{aligned}
(47)
\begin{aligned} &\widehat{x}_{2} =-\frac{\widetilde{y}_{-1}(\widehat{x}_{-2}- \widehat{x}_{-1})}{\widetilde{y}_{-2}-\widetilde{y}_{-1}}=\frac{ \widehat{y}_{-1}(\widehat{x}_{-2}-\widehat{x}_{-1})}{\widehat{y}_{-2}+ \widehat{y}_{-1}}, \end{aligned}
(48)
\begin{aligned} &\widehat{x}_{3} =-\frac{\widehat{x}_{-2}\widetilde{y}_{-1}}{ \widetilde{y}_{-2}-\widetilde{y}_{-1}}=\frac{\widehat{x}_{-2} \widehat{y}_{-1}}{\widehat{y}_{-2}+\widehat{y}_{-1}}, \end{aligned}
(49)
\begin{aligned} &\widehat{x}_{4} =\widehat{x}_{-2} , \end{aligned}
(50)
\begin{aligned} &\widehat{x}_{5} =\widehat{x}_{-1}, \end{aligned}
(51)

and

\begin{aligned} &\widehat{y}_{0} =\widetilde{y}_{0}=\frac{\widetilde{y}_{-1} \widehat{x}_{-2}}{\widehat{x}_{-2}-\widehat{x}_{-1}}=- \frac{ \widehat{y}_{-1}\widehat{x}_{-2}}{\widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(52)
\begin{aligned} &\widehat{y}_{1} =-\widetilde{y}_{1}=\frac{\widehat{x}_{-2}( \widetilde{y}_{-2}-\widetilde{y}_{-1})}{\widehat{x}_{-2}-\widehat{x} _{-1}}= \frac{\widehat{x}_{-2}(\widehat{y}_{-2}+\widehat{y}_{-1})}{ \widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(53)
\begin{aligned} &\widehat{y}_{2} =\widetilde{y}_{2}=-\frac{\widehat{x}_{-1}( \widetilde{y}_{-2}-\widetilde{y}_{-1})}{\widehat{x}_{-2}-\widehat{x} _{-1}} = \frac{\widehat{x}_{-1}(\widehat{y}_{-2}+\widehat{y}_{-1})}{- \widehat{x}_{-2}+\widehat{x}_{-1}}, \end{aligned}
(54)
\begin{aligned} &\widehat{y}_{3} =-\widetilde{y}_{3}=\frac{\widetilde{y}_{-2} \widehat{x}_{-1}}{\widehat{x}_{-2}-\widehat{x}_{-1}}= \frac{ \widehat{y}_{-2}\widehat{x}_{-1}}{\widehat{x}_{-2}-\widehat{x}_{-1}}, \end{aligned}
(55)
\begin{aligned} &\widehat{y}_{4} =\widetilde{y}_{4}=\widetilde{y}_{-2}= \widehat{y} _{-2}, \\ \end{aligned}
(56)
\begin{aligned} &\widehat{y}_{5} =-\widetilde{y}_{5}=- \widetilde{y}_{-1}=\widehat{y} _{-1}. \end{aligned}
(57)

### Theorem 4

Let $$(x_{n}, y_{n})_{n\ge -(2k+1)}$$ be a well-defined solution to system (5). Then the following statements hold.

1. (i)

Sequences $$(x_{n})_{n\ge -(2k+1)}$$ and $$(y_{n})_{n\ge -(2k+1)}$$ are periodic with period $$6(k+1)$$.

2. (ii)

We have

\begin{aligned} &x_{6(k+1)m+l}= \textstyle\begin{cases} \frac{x_{l-k-1}y_{l-2k-2}}{-y_{l-2k-2}+y_{l-k-1}} , & 1\le l\le k+1, \\ \frac{y_{l-3k-3}(x_{l-3k-3}+x_{l-2k-2})}{y_{l-3k-3}-y_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{y_{l-3k-3}(x_{l-4k-4}+x_{l-3k-3})}{-y_{l-4k-4}+y_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{y_{l-4k-4}x_{l-5k-5}}{y_{l-5k-5}-y_{l-4k-4}}, & 3k+4\le l\le 4k+4, \\ x_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \\ &y_{6(k+1)m+l}= \textstyle\begin{cases} \frac{y_{l-k-1}x_{l-2k-2}}{x_{l-2k-2}+x_{l-k-1}} , & 1\le l\le k+1, \\ \frac{x_{l-3k-3}(-y_{l-3k-3}+y_{l-2k-2})}{x_{l-3k-3}+x_{l-2k-2}}, & k+2 \le l\le 2k+2, \\ \frac{x_{l-3k-3}(y_{l-4k-4}-y_{l-3k-3})}{x_{l-4k-4}+x_{l-3k-3}}, & 2k+3 \le l\le 3k+3, \\ \frac{x_{l-4k-4}y_{l-5k-5}}{x_{l-5k-5}+x_{l-4k-4}}, & 3k+4\le l\le 4k+4, \\ y_{l-6k-6}, & 4k+5\le l\le 6k+6, \end{cases}\displaystyle \end{aligned}

for $$m\in {\mathbb{N}}_{0}$$.

Since system (5) is also a special case of system (6), we see that the system is equivalent to $$k+1$$ independent systems of the following form:

\begin{aligned} \widehat{x}_{m+1}=\frac{\widehat{x}_{m}\widehat{y}_{m-1}}{- \widehat{y}_{m-1}+\widehat{y}_{m}},\qquad \widehat{y}_{m+1}= \frac{ \widehat{y}_{m}\widehat{x}_{m-1}}{\widehat{x}_{m-1}+\widehat{x}_{m}}, \quad m\ge -1. \end{aligned}
(58)

Note that equation (58) is obtained from equation (43) by interchanging letters x and y. Thus, Theorem 4 directly follows from Theorem 3, which as we have already mentioned follows from known results, so it is also the case with Theorem 4.

### Remark 1

By using the change of variables

\begin{aligned} \widehat{x}_{m}=(-1)^{m}\widetilde{x}_{m},\quad m \ge -2, \end{aligned}
(59)

in (58), it easily follows that

\begin{aligned} \widetilde{x}_{m+1}=\frac{\widetilde{x}_{m} \widehat{y}_{m-1}}{ \widehat{y}_{m-1}-\widehat{y}_{m}},\qquad \widehat{y}_{m+1}= \frac{ \widehat{y}_{m} \widetilde{x}_{m-1}}{\widetilde{x}_{m-1}- \widetilde{x}_{m}},\quad m\ge -1. \end{aligned}
(60)

Hence, Theorem 4 can be also proved by Theorem 4 in , as it was the case with Theorems 2 and 3.

### Remark 2

Note that the changes of variables (29) in Theorem 2, (44) in Theorem 3, (59) in Remark 1, along with the interlacing argument explained above show that systems (3)–(5) are equivalent to system (2), so essentially only one result was proved in , which as we have explained follows from the known ones.

## Solvability of some extensions of system (6)

Here we show how some extensions of system (6) can be solved.

### A three-dimensional extension to system (6)

The following three-dimensional system of difference equations is a natural generalization of two-dimensional system (6):

\begin{aligned} &x_{n+1} =\frac{x_{n-k}y_{n-(2k+1)}}{ay_{n-(2k+1)}+by_{n-k}}, \\ &y_{n+1} =\frac{y_{n-k}z_{n-(2k+1)}}{cz_{n-(2k+1)}+dz_{n-k}}, \\ &z_{n+1} =\frac{z_{n-k}x_{n-(2k+1)}}{ex_{n-(2k+1)}+fx_{n-k}}, \end{aligned}
(61)

for $$n\in {\mathbb{N}}_{0}$$, where parameters a, b, c, d, e, f and initial values $$x_{-j}$$, $$y_{-j}$$, $$z_{-j}$$, $$j=\overline{0,2k+1}$$, are complex numbers, and $$k\in {\mathbb{N}}_{0}$$.

As in the previous section, it is proved that system (61) is a system of difference equations with interlacing indices of order $$k+1$$.

Let

\begin{aligned} &x_{m}^{(j)} :=x_{(k+1)m+j}, \end{aligned}
(62)
\begin{aligned} &y_{m}^{(j)} :=y_{(k+1)m+j}, \end{aligned}
(63)
\begin{aligned} &z_{m}^{(j)} :=z_{(k+1)m+j}, \end{aligned}
(64)

for $$m\ge -2$$, where $$j=\overline{1,k+1}$$.

Employing (62)–(64) in (61), we see that the system can be written as

\begin{aligned} &x_{m+1}^{(j)} =\frac{x_{m}^{(j)}y_{m-1}^{(j)}}{ay_{m-1}^{(j)}+by_{m} ^{(j)}}, \\ &y_{m+1}^{(j)} =\frac{y_{m}^{(j)}z_{m-1}^{(j)}}{cz_{m-1}^{(j)}+dz_{m} ^{(j)}}, \\ &z_{m+1}^{(j)} =\frac{z_{m}^{(j)}x_{m-1}^{(j)}}{ex_{m-1}^{(j)}+fx_{m} ^{(j)}}, \end{aligned}

for $$m\ge -1$$ and $$j=\overline{1,k+1}$$.

From this it follows that the sequences $$(x_{m}^{(j)},y_{m}^{(j)},z _{m}^{(j)})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, are $$k+1$$ independent solutions to the following second-order system of difference equations:

\begin{aligned} \begin{aligned} &\widehat{x}_{m+1} =\frac{\widehat{x}_{m}\widehat{y}_{m-1}}{a \widehat{y}_{m-1}+b\widehat{y}_{m}}, \\ &\widehat{y}_{m+1} =\frac{\widehat{y}_{m}\widehat{z}_{m-1}}{c \widehat{z}_{m-1}+d\widehat{z}_{m}}, \\ &\widehat{z}_{m+1} =\frac{\widehat{z}_{m}\widehat{x}_{m-1}}{e \widehat{x}_{m-1}+f\widehat{x}_{m}}, \end{aligned} \end{aligned}
(65)

for $$m\ge -1$$, with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$z_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, $$y_{j-(k+1)}$$, and $$z_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively.

By using the changes of variables

\begin{aligned} u_{m}=\frac{\widehat{x}_{m}}{\widehat{x}_{m-1}},\qquad v_{m}=\frac{ \widehat{y}_{m}}{\widehat{y}_{m-1}}, \qquad w_{n}=\frac{\widehat{z}_{m}}{ \widehat{z}_{m-1}}, \end{aligned}
(66)

$$m\ge -1$$, system (65) can be written in the following form:

\begin{aligned} u_{m+1}=\frac{1}{a+bv_{m}},\qquad v_{m+1}=\frac{1}{c+dw_{m}}, \qquad w _{m+1}=\frac{1}{e+fu_{m}}, \end{aligned}
(67)

for $$m\ge -1$$.

From (67) we obtain

\begin{aligned} &\begin{aligned}[b] u_{m+1} &=\frac{1}{a+bv_{m}}=\frac{1}{a+\frac{b}{c+dw_{m-1}}}= \frac{c+dw _{m-1}}{ac+b+adw_{m-1}}=\frac{c+\frac{d}{e+fu_{m-2}}}{ac+b+\frac{ad}{e+fu _{m-2}}} \\ &=\frac{ce+d+cfu_{m-2}}{ace+be+ad+(acf+bf)u_{m-2}}, \end{aligned} \end{aligned}
(68)
\begin{aligned} &\begin{aligned}[b] v_{m+1} &=\frac{1}{c+dw_{m}}=\frac{1}{c+\frac{d}{e+fu_{m-1}}}= \frac{e+fu _{m-1}}{ce+d+cfu_{m-1}}=\frac{e+\frac{f}{a+bv_{m-2}}}{ce+d+\frac{cf}{a+bv _{m-2}}} \\ &=\frac{ae+f+bev_{m-2}}{ace+ad+cf+(bce+bd)v_{m-2}}, \end{aligned} \end{aligned}
(69)
\begin{aligned} &\begin{aligned}[b] w_{m+1} &=\frac{1}{e+fu_{m}}=\frac{1}{e+\frac{f}{a+bv_{m-1}}}= \frac{a+bv _{m-1}}{ae+f+bev_{m-1}}=\frac{a+\frac{b}{c+dw_{m-2}}}{ae+f+\frac{be}{c+dw _{m-2}}} \\ &=\frac{ac+b+adw_{m-2}}{ace+be+cf+(ade+df)w_{m-2}},\end{aligned} \end{aligned}
(70)

for $$m\in {\mathbb{N}}$$.

Using the procedure in Sect. 2, it is seen that equations (68)–(70) are three equations with interlacing indices of order three.

Let

\begin{aligned} &u_{k}^{(j)} :=u_{3k+j}, \end{aligned}
(71)
\begin{aligned} &v_{k}^{(j)} :=v_{3k+j}, \end{aligned}
(72)
\begin{aligned} &w_{k}^{(j)} :=w_{3k+j}, \end{aligned}
(73)

for $$k\in {\mathbb{N}}_{0}$$, where $$j\in \{-1,0,1\}$$.

Employing (71)–(73) in (68)–(70), respectively, we see that the equations can be written as

\begin{aligned} &u_{k+1}^{(j)} = \frac{ce+d+cfu_{k}^{(j)}}{ace+be+ad+(acf+bf)u_{k}^{(j)}}, \end{aligned}
(74)
\begin{aligned} &v_{k+1}^{(j)} = \frac{ae+f+bev_{k}^{(j)}}{ace+ad+cf+(bce+bd)v_{k}^{(j)}}, \end{aligned}
(75)
\begin{aligned} &w_{k+1}^{(j)} = \frac{ac+b+adw_{k}^{(j)}}{ace+be+cf+(ade+df)w_{k}^{(j)}}, \end{aligned}
(76)

for $$k\in {\mathbb{N}}_{0}$$ and for each $$j\in \{-1,0,1\}$$.

From this it follows that the sequences $$(u_{k}^{(j)})_{k\in {\mathbb{N}} _{0}}$$, $$(v_{k}^{(j)})_{k\in {\mathbb{N}}_{0}}$$, $$(w_{k}^{(j)})_{k \in {\mathbb{N}}_{0}}$$, $$j\in \{-1,0,1\}$$, are three solutions to the following bilinear difference equations:

\begin{aligned} &u_{k+1} =\frac{ce+d+cfu_{k}}{ace+be+ad+(acf+bf)u_{k}}, \end{aligned}
(77)
\begin{aligned} &v_{k+1} =\frac{ae+f+bev_{k}}{ace+ad+cf+(bce+bd)v_{k}}, \end{aligned}
(78)
\begin{aligned} &w_{k+1} =\frac{ac+b+adw_{k}}{ace+be+cf+(ade+df)w_{k}}, \end{aligned}
(79)

for $$k\in {\mathbb{N}}_{0}$$, and with the initial values $$u_{j}$$, $$v_{j}$$, $$w_{j}$$, $$j\in \{-1,0,1\}$$, respectively.

Since bilinear difference equations are solvable, it follows that systems (77)–(79) are also solvable. From this and (71)–(76) it follows that equations (68)–(70) are solvable, from which along with (66) it easily follows that system (61) is also solvable.

### A four-dimensional extension to system (6)

The following four-dimensional system is another generalization of two-dimensional system (6):

\begin{aligned} &x_{n+1} =\frac{x_{n-k}y_{n-(2k+1)}}{ay_{n-(2k+1)}+by_{n-k}}, \\ &y_{n+1}=\frac{y _{n-k}z_{n-(2k+1)}}{cz_{n-(2k+1)}+dz_{n-k}}, \\ &z_{n+1}=\frac{z_{n-k}u _{n-(2k+1)}}{eu_{n-(2k+1)}+fu_{n-k}}, \\ &u_{n+1}=\frac{u_{n-k}x_{n-(2k+1)}}{gx _{n-(2k+1)}+hx_{n-k}}, \end{aligned}
(80)

for $$n\in {\mathbb{N}}_{0}$$, where parameters a, b, c, d, e, f, g, h and initial values $$x_{-j}$$, $$y_{-j}$$, $$z_{-j}$$, $$u_{-j}$$, $$j= \overline{0,2k+1}$$, are complex numbers, and $$k\in {\mathbb{N}}_{0}$$.

As in Sect. 2 it is proved that system (80) is a system of difference equations with interlacing indices of order $$k+1$$.

Let

\begin{aligned} &x_{m}^{(j)} :=x_{(k+1)m+j}, \end{aligned}
(81)
\begin{aligned} &y_{m}^{(j)} :=y_{(k+1)m+j}, \end{aligned}
(82)
\begin{aligned} &z_{m}^{(j)} :=z_{(k+1)m+j}, \end{aligned}
(83)
\begin{aligned} &u_{m}^{(j)} :=u_{(k+1)m+j}, \end{aligned}
(84)

for $$m\ge -2$$, and $$j=\overline{1,k+1}$$.

Employing (81)–(84) in (80), we see that the system can be written as

\begin{aligned} &x_{m+1}^{(j)} =\frac{x_{m}^{(j)}y_{m-1}^{(j)}}{ay_{m-1}^{(j)}+by_{m} ^{(j)}}, \\ &y_{m+1}^{(j)} =\frac{y_{m}^{(j)}z_{m-1}^{(j)}}{cz_{m-1}^{(j)}+dz_{m} ^{(j)}}, \\ &z_{m+1}^{(j)} =\frac{z_{m}^{(j)}u_{m-1}^{(j)}}{eu_{m-1}^{(j)}+fu_{m} ^{(j)}}, \\ &u_{m+1}^{(j)} =\frac{u_{m}^{(j)}x_{m-1}^{(j)}}{gx_{m-1}^{(j)}+hx_{m} ^{(j)}}, \end{aligned}

for $$m\ge -1$$ and $$j=\overline{1,k+1}$$.

From this it follows that the sequences $$(x_{m}^{(j)},y_{m}^{(j)},z _{m}^{(j)},u_{m}^{(j)})_{m\ge -2}$$, $$j=\overline{1,k+1}$$, are $$k+1$$ independent solutions to the following second-order system of difference equations:

\begin{aligned} \begin{aligned} &\widehat{x}_{m+1} = \frac{\widehat{x}_{m}\widehat{y}_{m-1}}{a \widehat{y}_{m-1}+b\widehat{y}_{m}}, \\ &\widehat{y}_{m+1}=\frac{ \widehat{y}_{m}\widehat{z}_{m-1}}{c\widehat{z}_{m-1}+d\widehat{z}_{m}}, \\ &\widehat{z}_{m+1}=\frac{\widehat{z}_{m}\widehat{u}_{m-1}}{e \widehat{u}_{m-1}+f\widehat{u}_{m}}, \\ &\widehat{u}_{m+1}=\frac{ \widehat{u}_{m}\widehat{x}_{m-1}}{g\widehat{x}_{m-1}+h\widehat{x}_{m}}, \end{aligned} \end{aligned}
(85)

for $$m\ge -1$$, with the initial values $$x_{j-(2k+2)}$$, $$y_{j-(2k+2)}$$, $$z_{j-(2k+2)}$$, $$u_{j-(2k+2)}$$, $$x_{j-(k+1)}$$, $$y_{j-(k+1)}$$, $$z_{j-(k+1)}$$, and $$u_{j-(k+1)}$$, $$j=\overline{1,k+1}$$, respectively.

By using the changes of variables

\begin{aligned} \alpha _{m}=\frac{\widehat{x}_{m}}{\widehat{x}_{m-1}},\qquad \beta _{m}= \frac{ \widehat{y}_{m}}{\widehat{y}_{m-1}},\qquad \gamma _{m}=\frac{ \widehat{z}_{m}}{\widehat{z}_{m-1}},\qquad \delta _{m}=\frac{ \widehat{u}_{m}}{\widehat{u}_{m-1}}, \end{aligned}
(86)

$$m\ge -1$$, system (85) can be written in the following form:

\begin{aligned} \begin{aligned} &\alpha _{m+1}= \frac{1}{a+b\beta _{m}}, \\ &\beta _{m+1}=\frac{1}{c+d\gamma _{m}}, \\ &\gamma _{m+1}=\frac{1}{e+f\delta _{m}}, \\ &\delta _{m+1}=\frac{1}{g+h\alpha _{m}}, \end{aligned} \end{aligned}
(87)

for $$m\ge -1$$.

From (87) we obtain

\begin{aligned} \alpha _{m+1} &=\frac{1}{a+b\beta _{m}}=\frac{1}{a+\frac{b}{c+d\gamma _{m-1}}}= \frac{c+d\gamma _{m-1}}{ac+b+ad\gamma _{m-1}}=\frac{c+\frac{d}{e+f \delta _{m-2}}}{ac+b+\frac{ad}{e+f\delta _{m-2}}} \\ &=\frac{ce+d+cf\delta _{m-2}}{ace+be+ad+(acf+bf)\delta _{m-2}} \\ &=\frac{ce+d+\frac{cf}{g+h\alpha _{m-3}}}{ace+be+ad+\frac{acf+bf}{g+h \alpha _{m-3}}} \\ &=\frac{ceg+dg+cf+(ceh+dh)\alpha _{m-3}}{aceg+beg+adg+acf+bf+(aceh+beh+adh) \alpha _{m-3}}, \end{aligned}
(88)
\begin{aligned} \beta _{m+1} &=\frac{1}{c+d\gamma _{m}}=\frac{1}{c+\frac{d}{e+f\delta _{m-1}}}= \frac{e+f\delta _{m-1}}{ce+d+cf\delta _{m-1}}=\frac{e+\frac{f}{g+h \alpha _{m-2}}}{ce+d+\frac{cf}{g+h\alpha _{m-2}}} \\ &=\frac{eg+f+eh\alpha _{m-2}}{ceg+dg+cf+(ceh+dh)\alpha _{m-2}} \\ &=\frac{eg+f+\frac{eh}{a+b\beta _{m-3}}}{ceg+dg+cf+\frac{ceh+dh}{a+b \beta _{m-3}}} \\ &=\frac{aeg+af+eh+(beg+bf)\beta _{m-3}}{aceg+adg+acf+ceh+dh+(bceg+bdg+bcf) \beta _{m-3}}, \end{aligned}
(89)
\begin{aligned} \gamma _{m+1} &=\frac{1}{e+f\delta _{m}}=\frac{1}{e+\frac{f}{g+h\alpha _{m-1}}}= \frac{g+h\alpha _{m-1}}{eg+f+eh\alpha _{m-1}}=\frac{g+\frac{h}{a+b \beta _{m-2}}}{eg+f+\frac{eh}{a+b\beta _{m-2}}} \\ &=\frac{ag+h+bg\beta _{m-2}}{aeg+af+eh+(beg+bf)\beta _{m-2}} \\ &=\frac{ag+h+\frac{bg}{c+d\gamma _{m-3}}}{aeg+af+eh+\frac{beg+bf}{c+d \gamma _{m-3}}} \\ &=\frac{acg+ch+bg+(adg+dh)\gamma _{m-3}}{aceg+acf+ceh+beg+bf+(adeg+adf+deh) \gamma _{m-3}}, \end{aligned}
(90)
\begin{aligned} \delta _{m+1} &=\frac{1}{g+h\alpha _{m}}=\frac{1}{g+\frac{h}{a+b\beta _{m-1}}}= \frac{a+b\beta _{m-1}}{ag+h+bg\beta _{m-1}}=\frac{a+\frac{b}{c+d \gamma _{m-2}}}{ag+h+\frac{bg}{c+d\gamma _{m-2}}} \\ &=\frac{ac+b+ad\gamma _{m-2}}{acg+bg+ch+(adg+dh)\gamma _{m-2}} \\ &=\frac{ac+b+\frac{ad}{e+f\delta _{m-3}}}{acg+bg+ch+\frac{adg+dh}{e+f \delta _{m-3}}} \\ &=\frac{ace+be+ad+(acf+bf)\delta _{m-3}}{aceg+beg+ceh+adg+dh+(acfg+bfg+cfh) \delta _{m-3}}, \end{aligned}
(91)

for $$m\ge 2$$.

Using the procedure from Sect. 2, it is seen that equations (88)–(91) are four equations with interlacing indices of order four.

Let

\begin{aligned} &\alpha _{k}^{(j)} :=\alpha _{4k+j}, \end{aligned}
(92)
\begin{aligned} &\beta _{k}^{(j)} :=\beta _{4k+j}, \end{aligned}
(93)
\begin{aligned} &\gamma _{k}^{(j)} :=\gamma _{4k+j}, \end{aligned}
(94)
\begin{aligned} &\delta _{k}^{(j)} :=\delta _{4k+j}, \end{aligned}
(95)

for $$k\in {\mathbb{N}}_{0}$$, where $$j\in \{-1,0,1,2\}$$.

Employing (92)–(95) in (88)–(91), respectively, we see that the equations can be written as

\begin{aligned} &\alpha _{k+1}^{(j)} =\frac{ceg+dg+cf+(ceh+dh)\alpha _{k}^{(j)}}{aceg+beg+adg+acf+bf+(aceh+beh+adh) \alpha _{k}^{(j)}}, \end{aligned}
(96)
\begin{aligned} &\beta _{k+1}^{(j)} =\frac{aeg+af+eh+(beg+bf)\beta _{k}^{(j)}}{aceg+adg+acf+ceh+dh+(bceg+bdg+bcf) \beta _{k}^{(j)}}, \end{aligned}
(97)
\begin{aligned} &\gamma _{k+1}^{(j)} =\frac{acg+ch+bg+(adg+dh)\gamma _{k}^{(j)}}{aceg+acf+ceh+beg+bf+(adeg+adf+deh) \gamma _{k}^{(j)}}, \end{aligned}
(98)
\begin{aligned} &\delta _{k+1}^{(j)} =\frac{ace+be+ad+(acf+bf)\delta _{k}^{(j)}}{aceg+beg+ceh+adg+dh+(acfg+bfg+cfh) \delta _{k}^{(j)}}, \end{aligned}
(99)

for $$k\in {\mathbb{N}}_{0}$$ and for each $$j\in \{-1,0,1,2\}$$.

From this it follows that the sequences $$(\alpha _{k}^{(j)})_{k\in {\mathbb{N}}_{0}}$$, $$(\beta _{k}^{(j)})_{k\in {\mathbb{N}}_{0}}$$, $$(\gamma _{k}^{(j)})_{k\in {\mathbb{N}}_{0}}$$, $$(\delta _{k}^{(j)})_{k \in {\mathbb{N}}_{0}}$$, $$j\in \{-1,0,1,2\}$$, are four solutions to the following bilinear difference equations:

\begin{aligned} &\widehat{\alpha }_{k+1} =\frac{ceg+dg+cf+(ceh+dh)\widehat{\alpha } _{k}}{aceg+beg+adg+acf+bf+(aceh+beh+adh)\widehat{\alpha }_{k}}, \end{aligned}
(100)
\begin{aligned} &\widehat{\beta }_{k+1} =\frac{aeg+af+eh+(beg+bf)\widehat{\beta }_{k}}{aceg+adg+acf+ceh+dh+(bceg+bdg+bcf) \widehat{\beta }_{k}}, \end{aligned}
(101)
\begin{aligned} &\widehat{\gamma }_{k+1} =\frac{acg+ch+bg+(adg+dh)\widehat{\gamma } _{k}}{aceg+acf+ceh+beg+bf+(adeg+adf+deh)\widehat{\gamma }_{k}}, \end{aligned}
(102)
\begin{aligned} &\widehat{\delta }_{k+1} =\frac{ace+be+ad+(acf+bf)\widehat{\delta } _{k}}{aceg+beg+ceh+adg+dh+(acfg+bfg+cfh)\widehat{\delta }_{k}}, \end{aligned}
(103)

for $$k\in {\mathbb{N}}_{0}$$, with the initial values $$\alpha _{j}$$, $$\beta _{j}$$, $$\gamma _{j}$$, $$\delta _{j}$$, $$j\in \{-1,0,1,2\}$$, respectively.

Since bilinear difference equations are solvable in closed form, it follows that systems (100)–(103) are also solvable. From this along with (92)–(99) it follows that equations (88)–(91) are solvable, from which and (86) it follows that system (80) is also solvable.

### Remark 3

We will not present closed-form formulas for solutions to systems (61) and (80) since it is done in a standard way by using a method for solving bilinear difference equations along with the changes of variables given in this section. By using such obtained closed-form formulas for solutions to the systems, the long-term behavior of their solutions can be described, which can be done as in our papers [28, 29, 34]. We leave the standard problem to the reader as an exercise.

### Remark 4

The corresponding extensions of system (2), which are obtained from systems (61) and (80), are the following:

\begin{aligned} &x_{n+1} =\frac{x_{n-k}y_{n-(2k+1)}}{y_{n-(2k+1)}-y_{n-k}}, \\ &y_{n+1} =\frac{y_{n-k}z_{n-(2k+1)}}{z_{n-(2k+1)}-z_{n-k}}, \\ &z_{n+1} =\frac{z_{n-k}x_{n-(2k+1)}}{x_{n-(2k+1)}-x_{n-k}}, \end{aligned}
(104)

for $$n\in {\mathbb{N}}_{0}$$, where $$k\in {\mathbb{N}}_{0}$$, and

\begin{aligned} &x_{n+1} = \frac{x_{n-k}y_{n-(2k+1)}}{y_{n-(2k+1)}-y_{n-k}}, \\ &y_{n+1}=\frac{y _{n-k}z_{n-(2k+1)}}{z_{n-(2k+1)}-z_{n-k}}, \\ &z_{n+1}=\frac{z_{n-k}u _{n-(2k+1)}}{u_{n-(2k+1)}-u_{n-k}}, \\ &u_{n+1}=\frac{u_{n-k}x_{n-(2k+1)}}{x _{n-(2k+1)}-x_{n-k}}, \end{aligned}
(105)

for $$n\in {\mathbb{N}}_{0}$$, where $$k\in {\mathbb{N}}_{0}$$.

Since systems (104) and (105) are three- and four-dimensional cyclic systems, respectively, and the scalar difference equation

\begin{aligned} x_{n+1}=\frac{x_{n-k}x_{n-(2k+1)}}{x_{n-(2k+1)}-x_{n-k}} \end{aligned}
(106)

is periodic with period $$6(k+1)$$ (as an interlacing equation of order $$k+1$$ and since for $$k=0$$ an equation of period six is obtained; see also equalities (16)–(21), where letter y is replaced by letter x), it is known that system (104) must be periodic with period $$18(k+1)$$, whereas (105) must be periodic with period $$24(k+1)$$.

## References

1. 1.

Agarwal, R.P.: Difference Equations and Inequalities: Theory, Methods, and Applications, 2nd edn. Dekker, New York (2000)

2. 2.

Boole, G.: A Treatsie on the Calculus of Finite Differences, 3rd edn. Macmillan & Co., London (1880)

3. 3.

Fort, T.: Finite Differences and Difference Equations in the Real Domain. Clarendion Press, Oxford (1948)

4. 4.

Jordan, C.: Calculus of Finite Differences. Chelsea, New York (1956)

5. 5.

Krechmar, V.A.: A Problem Book in Algebra. Mir, Moscow (1974) (Russian first edition 1937)

6. 6.

Markoff, A.A.: Differenzenrechnung, Leipzig (1896) (in German)

7. 7.

Milne-Thomson, L.M.: The Calculus of Finite Differences. MacMillan & Co., London (1933)

8. 8.

Mitrinović, D.S., Kečkić, J.D.: Methods for Calculating Finite Sums. Naučna Knjiga, Beograd (1984) (in Serbian)

9. 9.

Nörlund, N.E.: Vorlesungen über Differenzenrechnung. Springer, Berlin (1924) (in German)

10. 10.

Richardson, C.H.: An Introduction to the Calculus of Finite Differences. Van Nostrand, Toronto (1954)

11. 11.

Stević, S.: Bounded solutions to nonhomogeneous linear second-order difference equations. Symmetry 9, Article ID 227 (2017)

12. 12.

Agarwal, R.P., Popenda, J.: Periodic solutions of first order linear difference equations. Math. Comput. Model. 22(1), 11–19 (1995)

13. 13.

Berezansky, L., Braverman, E.: On impulsive Beverton–Holt difference equations and their applications. J. Differ. Equ. Appl. 10(9), 851–868 (2004)

14. 14.

Mitrinović, D.S.: Matrices and Determinants. Naučna Knjiga, Beograd (1989) (in Serbian)

15. 15.

Mitrinović, D.S., Adamović, D.D.: Sequences and Series. Naučna Knjiga, Beograd (1980) (in Serbian)

16. 16.

Riordan, J.: Combinatorial Identities. Wiley, New York (1968)

17. 17.

Stević, S.: First-order product-type systems of difference equations solvable in closed form. Electron. J. Differ. Equ. 2015, Article ID 308 (2015)

18. 18.

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)

19. 19.

Stević, S., Alghamdi, M.A., Alotaibi, A., Elsayed, E.M.: Solvable product-type system of difference equations of second order. Electron. J. Differ. Equ. 2015, Article ID 169 (2015)

20. 20.

Brand, L.: Differential and Difference Equations. Wiley, New York (1966)

21. 21.

Adamović, D.: Solution to problem 194. Mat. Vesn. 23, 236–242 (1971)

22. 22.

Brand, L.: A sequence defined by a difference equation. Am. Math. Mon. 62(7), 489–492 (1955)

23. 23.

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)

24. 24.

Stević, S., Iričanin, B., Šmarda, Z.: On a symmetric bilinear system of difference equations. Appl. Math. Lett. 89, 15–21 (2019)

25. 25.

Alfred, B.U.: An Introduction to Fibonacci Discovery, the Fibonacci Association (1965)

26. 26.

Vorobiev, N.N.: Fibonacci Numbers. Birkhäuser, Basel (2002) (Russian original 1950)

27. 27.

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)

28. 28.

Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: Solvability of nonlinear difference equations of fourth order. Electron. J. Differ. Equ. 2014, Article ID 264 (2014)

29. 29.

Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: On the system of difference equations $$x_{n}=x_{n-1}y_{n-2}/(ay_{n-2}+by_{n-1})$$, $$y_{n}=y_{n-1}x_{n-2}/(cx _{n-2}+dx_{n-1})$$. Appl. Math. Comput. 270, 688–704 (2015)

30. 30.

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)

31. 31.

Stević, S.: On the difference equation $$x_{n}=x_{n-2}/(b_{n}+c_{n}x _{n-1}x_{n-2})$$. Appl. Math. Comput. 218, 4507–4513 (2011)

32. 32.

Stević, S.: On the system of difference equations $$x_{n}=c_{n}y_{n-3}/(a_{n}+b_{n}y_{n-1}x_{n-2}y_{n-3})$$, $$y_{n}=\gamma_{n} x_{n-3}/(\alpha_{n}+\beta_{n} x_{n-1}y_{n-2}x_{n-3})$$. Appl. Math. Comput. 219, 4755–4764 (2013)

33. 33.

Stević, S., Iričanin, B., Šmarda, Z.: Solvability of a close to symmetric system of difference equations. Electron. J. Differ. Equ. 2016, Article ID 159 (2016)

34. 34.

Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: On a third-order system of difference equations with variable coefficients. Abstr. Appl. Anal. 2012, Article ID 508523 (2012)

35. 35.

Stević, S., Diblik, J., Iričanin, B., Šmarda, Z.: On a solvable system of rational difference equations. J. Differ. Equ. Appl. 20(5–6), 811–825 (2014)

36. 36.

Berg, L., Stević, S.: On some systems of difference equations. Appl. Math. Comput. 218, 1713–1718 (2011)

37. 37.

Papaschinopoulos, G., Schinas, C.J.: On a system of two nonlinear difference equations. J. Math. Anal. Appl. 219(2), 415–426 (1998)

38. 38.

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)

39. 39.

Papaschinopoulos, G., Schinas, C.J.: Invariants for systems of two nonlinear difference equations. Differ. Equ. Dyn. Syst. 7, 181–196 (1999)

40. 40.

Papaschinopoulos, G., Schinas, C.J.: Invariants and oscillation for systems of two nonlinear difference equations. Nonlinear Anal., Theory Methods Appl. 46, 967–978 (2001)

41. 41.

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)

42. 42.

Papaschinopoulos, G., Schinas, C.J.: On the dynamics of two exponential type systems of difference equations. Comput. Math. Appl. 64(7), 2326–2334 (2012)

43. 43.

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)

44. 44.

Stefanidou, G., Papaschinopoulos, G., Schinas, C.: On a system of max difference equations. Dyn. Contin. Discrete Impuls. Syst., Ser. A 14(6), 885–903 (2007)

45. 45.

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)

46. 46.

Gocen, M., Cebeci, A.: On the periodic solutions of some systems of higher order difference equations. Rocky Mt. J. Math. 48(3), 845–858 (2018)

47. 47.

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)

48. 48.

Stević, S.: New class of solvable systems of difference equations. Appl. Math. Lett. 63, 137–144 (2017)

49. 49.

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)

50. 50.

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)

51. 51.

Stević, S., Iričanin, B., Šmarda, Z.: Two-dimensional product-type system of difference equations solvable in closed form. Adv. Differ. Equ. 2016, Article ID 253 (2016)

52. 52.

Stević, S.: Periodicity of max difference equations. Util. Math. 83, 69–71 (2010)

53. 53.

Stević, S.: On some periodic systems of max-type difference equations. Appl. Math. Comput. 218, 11483–11487 (2012)

54. 54.

Iričanin, B., Stević, S.: Eventually constant solutions of a rational difference equation. Appl. Math. Comput. 215, 854–856 (2009)

### Acknowledgements

The work of Bratislav Iričanin was supported by the Serbian Ministry of Education and Science projects III 41025 and OI 171007, work of Stevo Stević by projects III 41025 and III 44006, while the work of Zdeněk Šmarda was supported by the project FEKT-S-17-4225 of Brno University of Technology.

Not applicable.

## Funding

FEKT-S-17-4225 of Brno University of Technology.

## Author information

Authors

### Contributions

All authors contributed equally to the writing of this paper. All authors read and approved the manuscript.

### Corresponding author

Correspondence to Stevo Stević.

## Ethics declarations

### Competing interests

The authors declare that they have no competing interests. 