Introduction

Recently, there has been great interest in studying difference equation systems. One of the reasons for this is the necessity for some techniques that can be used in investigating equations arising in mathematical models describing real life situations in population biology, economics, probability theory, etc. There are many papers related to the difference equations system for example, such as [110].

Cinar [1] studied the solutions of the system of difference equations:

x n + 1 = 1 y n , y n + 1 = y n x n 1 y n 1 ,n=0,1,,
(1)

Camouzis and Papaschinnopoulos [2] studied the global asymptotic behavior of positive solution of the system of rational difference equations:

x n + 1 =1+ x n y n m , y n + 1 =1+ y n x n m ,n=0,1,,
(2)

Ozban [3] studied the system of rational difference equations:

x n = a y n 3 , y n = b y n 3 x n q y n q ,n=0,1,,
(3)

Kurbanli et al. [4] studied the behavior of positive solutions of the system of rational difference equations:

x n = x n 1 y n x n 1 + 1 , y n = y n 1 x n y n 1 + 1 ,n=0,1,.
(4)

In the monograph of Dynamics of second order rational difference equations with open problems and conjecture[11], Kulenović and Ladas give a conjecture (see [11] p196) as following:

Conjecture 11.4.10. Show that every positive solution of the equation

x n + 1 = x n + x n 2 x n 1 ,n=0,1,,
(5)

converges to a period-four solution.

Stević [12] has solved the Conjecture.

In this paper, we introduce the difference equation system

x n + 1 = y n + y n 2 x n 1 , y n + 1 = x n + x n 2 y n 1 ,n=0,1,
(6)

where x i ,y i ∈(0,),i∈{−2,−1,0}.

Obviously, we can see that if the initial value satisfy x i =y i for i∈{−2,−1,0}, then the system (6) reduces into the Eq. (5). Hence, we can also solve the Conjecture 11.4.10. However, we study the system (6).

In this paper, we can obtain the solution of system (6) converges to periodic solution. At the same time, we can get the oscillatory of the system (6).

Before giving some results of the system (6), we need some definitions as follows [5]:

Definition 1. A pair of sequences of positive real numbers x n , y n n = 3 that satisfies system (6) is a positive solution of system (6). If a positive solution of system (6) is a pair of positive constants ( x ̄ , y ̄ ), that solution is the equilibrium solution.

Definition 2. A ‘string’ of consecutive terms {x s ,⋯, x m }(resp. {y s ,⋯,y m }),(s≥−3, m) is said to be a positive semicycle if x i x ̄ (resp. y i y ̄ ), {is,⋯,m}, x s 1 < x ̄ (resp. y s 1 < y ̄ ), and x m + 1 < x ̄ (resp. y m + 1 < y ̄ ). Otherwise, that is said to be a negative semicycle.

A ‘string’ of consecutive terms {(x s ,y s ),⋯,(x m ,y m )} is said to be a positive(resp.negative) semicycle if {x s ,⋯,x m }, {y s ,⋯,y m } are positive (resp.negative) semicycle.

A solution {x n }(resp. {y n }) oscillates about x ̄ (resp. y ̄ ) if for every iN, there exist s,mN, si, mi, such that x s x ̄ x m x ̄ <0(resp. (y s c)(y m c)<0). We say that a solution x n , y n n = 3 of system oscillates about( x ̄ , y ̄ ) if {x n } oscillates about x ̄ or {y n } oscillates about y ̄ .

Some Lemmas

We now present some Lemmas which will be usefully in the proof of the following Theorems.

Lemma 1. The system of (6) has a unique positive equilibrium x ̄ = y ̄ =2.

The proof of Lemma 1 is very easy, thus we omit it.

Lemma 2. Assume that p> 0, q > 0, pm > 1, r >0, m >0, rq > 1. Then {p,q}, {r,m}, m + p 2 pm 1 , q + r 2 rq 1 , r + q 2 rq 1 , p + m 2 pm 1 , ⋯, {p,q}, {r,m}, m + p 2 pm 1 , q + r 2 rq 1 , r + q 2 rq 1 , p + m 2 pm 1 is a period-four solution of the system (6).

Proof. Let {p1,p2}, {p3,p4}, {p5,p6}, {p7,p8}, ⋯, {p1,p2}, {p3,p4}, {p5,p6}, {p7,p8} ⋯ be a period-four solution of system (6).

Then by Eq. (6), we obtain

p 1 = p 4 + p 8 p 5 p 4 = p 1 + p 5 p 8 p 5 = p 4 + p 8 p 1 p 8 = p 1 + p 5 p 4 p 2 = p 3 + p 7 p 6 p 3 = p 2 + p 6 p 7 p 6 = p 3 + p 7 p 2 p 7 = p 2 + p 6 p 3
(7)

Noting that Eq. (7) can be changed into

p 1 p 5 = p 4 + p 8 p 4 p 8 = p 1 + p 5 p 2 p 6 = p 3 + p 7 p 3 p 7 = p 2 + p 6
(8)

We suppose that p1=p, p2=q, p3=r, p4=m.

Then by Eq. (8) we can get

p 5 = m + p 2 pm 1 , p 6 = q + r 2 rq 1 , p 7 = r + q 2 rq 1 , p 8 = p + m 2 pm 1 .

Hence, we complete the proof. □

Lemma 3. Assume that the initial points x i ,y i ∈(0, ∞), i ∈ {−2,−1,0}, x n , y n n = 2 is a positive solution of system (6). Then the following statements are true:

  1. (a)

    If y 1 2 + x 0 + x 2 < x 2 y 1 x 0 , x 1 2 + y 0 + y 2 < y 2 x 1 y 0 , then x 4 n + i , y 4 n + i n = 0 is decreasing, where i ∈ {− 2, − 1, 0, 1}.

  2. (b)

    If y 1 2 + x 0 + x 2 = x 2 y 1 x 0 , x 1 2 + y 0 + y 2 = y 2 x 1 y 0 , then x4n−2=x−2, x4n−1=x−1, x4n=x0 and x4n+1=x1; y4n−2=y−2, y4n−1=y−1, y4n=y0 and y4n+1=y1, n=0,1,⋯.

  3. (c)

    If y 1 2 + x 0 + x 2 > x 2 y 1 x 0 , x 1 2 + y 0 + y 2 > y 2 x 1 y 0 , then x 4 n + i , y 4 n + i n = 0 is increasing, where i ∈ {− 2, − 1, 0, 1}.

  4. (d)

    If y 1 2 + x 0 + x 2 x 2 y 1 x 0 , x 1 2 + y 0 + y 2 y 2 x 1 y 0 , then x 4 n 2 n = 0 , x 4 n n = 0 , y 4 n 1 n = 0 , y 4 n + 1 n = 0 is decreasing, and y 4 n 2 n = 0 , y 4 n n = 0 , x 4 n 1 n = 0 , x 4 n + 1 n = 0 is increasing.

  5. (e)

    If y 1 2 + x 0 + x 2 x 2 y 1 x 0 , x 1 2 + y 0 + y 2 y 2 x 1 y 0 , then x 4 n 2 n = 0 , x 4 n n = 0 , y 4 n 1 n = 0 , y 4 n + 1 n = 0 is increasing, and y 4 n 2 n = 0 , y 4 n n = 0 , x 4 n 1 n = 0 , x 4 n + 1 n = 0 is decreasing.

Proof. Part(a):

By system (6), we can get

x n + 1 = y n + y n 2 x n 1 = y n + y n 2 y n 2 + y n 4 x n 3 , y n + 1 = x n + x n 2 y n 1 = x n + x n 2 x n 2 + x n 4 y n 3

i.e.

x n + 3 x n 1 = y n + y n y n + y n 2 , y n + 3 y n 1 = x n + x n x n + x n 2 ,
(9)

for n≥0.

By the condition y 1 2 + x 0 + x 2 < x 2 y 1 x 0 , x 1 2 + y 0 + y 2 < y 2 x 1 y 0 , we can obtain

x 2 = y 1 + y 1 x 0 = y 1 + x 2 + x 0 y 1 x 0 = y 1 2 + x 2 + x 0 y 1 x 0 < x 2 y 2 = x 1 + x 1 y 0 = x 1 + y 2 + y 0 x 1 y 0 = x 1 2 + y 2 + y 0 x 1 x 0 < y 2

Next, by Eq. (9), we can get

y 3 < y 1 , x 4 < x 0 , y 5 < y 1 , x 6 < x 2 , y 7 < y 3 , x 8 < x 4 , y 9 < y 5 , x 10 < x 6 , x 3 < x 1 , y 4 < y 0 , x 5 < x 1 , y 6 < y 2 , x 7 < x 3 , y 8 < y 4 , x 9 < x 5 , y 10 < y 6 ,

Therefore by induction, we can get x 4 n + i , y 4 n + i n = 0 is decreasing for i∈{−2,−1,0,1}.

Part(b): By system (6), we can easily prove that part(b) holds. Hence, we omit the proof of part(b).

Using the same method in the proof of part(a), we can prove part(c) also holds.

Part(d): By the condition y 1 2 + x 0 + x 2 x 2 y 1 x 0 , x 1 2 + y 0 + y 2 y 2 x 1 y 0 , we obtain

x 2 = y 1 + y 1 x 0 = y 1 + x 2 + x 0 y 1 x 0 = y 1 2 + x 2 + x 0 y 1 x 0 x 2 y 2 = x 1 + x 1 y 0 = x 1 + y 2 + y 0 x 1 y 0 = x 1 2 + y 2 + y 0 x 1 x 0 y 2

Then, by Eq. (9), we can get

y 3 y 1 , x 4 x 0 , y 5 y 1 , x 6 x 2 , y 7 y 3 , x 8 x 4 , y 9 y 5 , x 10 x 6 , x 3 x 1 , y 4 y 0 , x 5 x 1 , y 6 y 2 , x 7 x 3 , y 8 y 4 , x 9 x 5 , y 10 y 6 ,

Therefore by induction, we can get part(d) also holds.

Part(e): The proof is similar with the part(d), so we omit it.

Hence, we complete the proof of Lemma 3. □

Lemma 4. Assume that x i , y i ∈ (2, ∞), i ∈ {− 2, − 1, 0}. Then there does not exist a positive solution x n , y n n = 2 of the system (6) such that x 4 n + i , y 4 n + i n = 0 is increasing, where i ∈ {− 2, − 1, 0, 1}.

Proof. Assume, for the sake of contradiction, that there exists a positive solution x n , y n n = 2 , such that x 4 n + i , y 4 n + i n = 0 is increasing, where i∈{−2,−1,0,1}, x i ,y i ∈(2,),i∈{−2,−1,0}.

By system (6), we can get

x n + 1 = y n + y n 2 x n 1 y n + y n 2 2 max y n , y n 2 y n + 1 = x n + x n 2 y n 1 x n + x n 2 2 max x n , x n 2
(10)

Then, we can get

x n + 1 max x n 1 , x n 3 , x n 5 y n + 1 max y n 1 , y n 3 , y n 5 .
(11)

Because of xn−5<xn−1, we can get xn+1≤ max{xn−1,xn−3}.

More, we can get

x n + 1 max x n 1 , x n 3 x n + 2 max x n , x n 2 x n + 3 max x n + 1 , x n 1 x n + 4 max x n + 2 , x n ,

which can be written as

x n + 1 max x n 1 , x n 3 x n + 2 max x n , x n 2 x n + 3 max x n 1 , x n 3 x n + 4 max x n , x n 2 .

If xn−1xn−3, then xn+3xn−1, which is contradiction;

If xn−3xn−1, then xn+1xn−3, which is contradiction;

If x n xn−2, then xn+4x n , which is contradiction;

If xn−2x n , then xn+2xn−2, which is contradiction.

They are contradictions and we complete the proof. □

Lemma 5. Assume that x i , y i ∈ (0, 2), i = {− 2, − 1, 0}. Then there does not exist a positive solution x n , y n n = 2 of the system (6) such that x 4 n + i , y 4 n + i n = 0 is decreasing, where i ∈ {− 2, − 1, 0, 1}.

The proof of Lemma 5 is similar with the proof of Lemma 4, so we omit it.

Results and discussion

In this section, we study five cases of the solution of the system (6). We get the solution of system (6) eventually converges to period-four solution.

Theorem 1. Assume that the initial points x i , y i ∈ (0, ∞), i ∈ {− 2, − 1, 0}, x n , y n n = 2 is a positive solution of the system (6). Then the following statement are true:

If y 1 2 + x 0 + x 2 < x 2 y 1 x 0 , x 1 2 + y 0 + y 2 < y 2 x 1 y 0 , then x 4 n i , y 4 n i n = 0 is decreasing, where i ∈ {− 2, − 1, 0, 1}, and x n , y n n = 2 converges to a period-four solution as following

p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , , p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , .

Proof. By Lemma 3(a), we can get

x 4 n i , y 4 n i n = 0 is decreasing for i 2 , 1 , 0 , 1

Because ‘Monotone bounded sequence must have limit,’ we can set

lim n x 4 n 2 , y 4 n 2 = ( p 1 , p 2 ) , lim n x 4 n 1 , y 4 n 1 = ( p 3 , p 4 ) . lim n x 4 n , y 4 n = ( p 5 , p 6 ) , lim n x 4 n + 1 , y 4 n + 1 = ( p 7 , p 8 )

With no loss of generality, we consider these three cases as followings:

  1. (a)

    p1=p2=p3=p4=p5=p6=p7=p8=0

  2. (b)
    i = 1 8 p i 2 >0, i = 1 8 p i =0
  3. (c)
    i = 1 8 p i 2 >0, i = 1 8 p i >0

Now, if we can prove case(a) and cade(b) do not hold, then we can obtain only case(c) holds.

By Lemma 5, we know that case(a) does not hold.

Next we try to prove the case(b) do not hold.

By the system (6), we can get

x n + 1 x n 1 = y n + y n 2 y n + 1 y n 1 = x n + x n 2 .
(12)

By limiting both sides of Eq. (12), we can get

lim n x n + 1 x n 1 = lim n y n + lim n y n 2 lim n y n + 1 y n 1 = lim n x n + lim n x n 2 .
(13)

If i = 1 8 p i =0, the identical Equation (12) do not hold. Hence, case(b) does not hold.

At last, only case(c) holds. We complete the proof. □

Corollary 1. Suppose that x n , y n n = 2 is a positive solution of system (6). Then the following statement is true:

If y 1 2 + x 0 + x 2 < x 2 y 1 x 0 , x 1 2 + y 0 + y 2 < y 2 x 1 y 0 , then the solution of system (6) oscillates about equilibrium ( x ̄ , y ̄ ). Besides the positive semicycle have at most three terms, at least one term; the negative semicycle have at most three terms and at least one term.

Theorem 2. Assume that the initial points x i , y i ∈ (0, ∞), i ∈ {− 2, − 1, 0}, x n , y n n = 2 are a positive solution of the system (6). Then the following statements are true:

If y 1 2 + x 0 + x 2 = x 2 y 1 x 0 , x 1 2 + y 0 + y 2 = y 2 x 1 y 0 , then {x−2,y−2}, {x−1,y−1}, {x0,y0}, {x1,y1}, ⋯, {x−2,y−2}, {x−1,y−1}, {x0,y0}, {x1,y1}, ⋯ is a period-four solution of the system (6), where x 0 = x 2 + x 1 2 x 2 x 1 1 , x 1 = x 2 2 + x 1 x 2 x 1 1 .

Proof. By the Lemma 8 and Lemma 3(b), we can prove the Theorem 2. Hence, we omit it. □

Theorem 3. Assume that the initial points x i , y i ∈ (0, ∞), i ∈ {− 2, − 1, 0}, x n , y n n = 2 are a positive solution of the system (6). Then the following statements are true:

If y 1 2 + x 0 + x 2 > x 2 y 1 x 0 , x 1 2 + y 0 + y 2 > y 2 x 1 y 0 , then x 4 n i , y 4 n i n = 0 is decreasing, where i ∈ {− 2, − 1, 0, 1} and x n , y n n = 2 converges to a period-four solution as following:

p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , , p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , .

Proof. By Lemma 3(c), we can get:

x 4 n i , y 4 n i n = 0 is increasing for i 2 , 1 , 0 , 1 .

Then, by Eq. (3), we can get

x n + 3 x n 1 = y n + 2 + y n y n + y n 2 < y n + 2 y n 2 y n + 3 y n 1 = x n + 2 + x n x n + x n 2 < x n + 2 x n 2
(14)

i.e.

x n 2 x n + 2 < y n 1 y n + 3 < x n x n + 4 < y n + 1 y n + 5
(15)
y n 2 y n + 2 < x n 1 x n + 3 < y n y n + 4 < x n + 1 x n + 5
(16)

Next, we can get:

y 2 y 2 < x 1 x 3 < y 0 y 4 < x 1 x 5 < y 2 y 6 < x 3 x 7 < y 4 y 8 < x 5 x 9 < y 6 y 10 < x 7 x 11 < y 8 y 12 x 2 x 2 < y 1 y 3 < x 0 x 4 < y 1 y 5 < x 2 x 6 < y 3 y 7 < x 4 x 8 < y 5 y 9 < x 6 x 10 < y 7 y 11 < x 8 x 12

Besides, if 0<a<b<c<d, we can get a c<b c<b d. Hence by induction and the above inequality, we can get:

y 2 y 4 n + 2 < x 1 x 4 n + 3 < y 0 y 4 n + 4 < x 1 x 4 n + 5 < y 2 y 4 n + 6 < x 3 x 4 n + 7
(17)
x 2 x 4 n + 2 < y 1 y 2 n + 3 < x 0 x 4 n + 4 < y 1 y 4 n + 5 < x 2 x 4 n + 6 < y 3 y 4 n + 7
(18)

We can set lim n x 4 n + 1 = p 1 , lim n x 4 n + 2 =p2, lim n x 4 n + 3 = p 3 , lim n x 4 n + 4 = p 4 , lim n y 4 n + 1 = p 5 , lim n y 4 n + 2 = p 6 , lim n y 4 n + 3 = p 7 , lim n y 4 n + 4 = p 8 .

From Lemma 10, we know that there at least one p i <2. Then by Limiting Theorem, we can get at least one of the limiting of p i must exist. With no loss ordinary, we set the limit of {x4n+1} exists, i.e. p1<2.

By limiting the inequation (17), we can get

lim n y 2 y 4 n + 2 lim n x 1 x 4 n + 3 lim n y 0 y 4 n + 4 lim n x 1 x 4 n + 5 lim n y 2 y 4 n + 6
(19)

Hence, we can get the limits of {y4n+2}, {x4n+3} and {y4n+4} are all exists. We can prove p3<, p6<, and p8<.

From Eq (18), we can get:

x 2 y 1 < x 4 n + 2 y 4 n + 3 < x 4 n + 6 y 4 n + 3 < x 2 y 1 , x 0 y 1 < x 4 n + 4 y 4 n + 5 < x 4 n + 8 y 4 n + 5 < x 4 y 1

Hence, we can obtain lim n x 4 n + 2 y 4 n + 3 =k, lim n x 4 n + 4 y 4 n + 5 =l, and 0<k<, 0<l<

Assume that lim n x 4 n + 2 =, lim n x 4 n + 4 =, lim n y 4 n + 1 =, lim n y 4 n + 3 =.

By the system (6), we can get

x 4 n + 2 x 4 n = y 4 n + 1 + y 4 n 1

which can be changed into

1= y 4 n + 1 + y 4 n 1 x 4 n + 2 x 4 n .
(20)

By limiting the both side of Eq. (20), we can get the right side of equation is lim n y 4 n + 1 + y 4 n 1 x 4 n + 2 x 4 n =0, which is contradiction.

Hence, use the same method, we can get lim n x 4 n + 2 <, lim n x 4 n + 4 <, lim n y 4 n + 1 <, lim n y 4 n + 3 <.

i.e.

p i < + , i = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 }

Therefore, we complete the proof. □

Corollary 2. Suppose that x n , y n n = 2 is a positive solution of system (6). Then the following statement is true:

If y 1 2 + x 0 + x 2 > x 2 y 1 x 0 , x 1 2 + y 0 + y 2 > y 2 x 1 y 0 , then the solution of system (6) oscillates about equilibrium ( x ̄ , y ̄ ). Besides, the positive semicycle have at most three terms, at least one term; the negative semicycle have at most three terms, at least one term.

Theorem 4. Assume that the initial points x i , y i ∈ (0, ∞), i ∈ {− 2, − 1, 0}, x n , y n n = 2 are a positive solution of the system (6). Then, the following statements are true:

If y 1 2 + x 0 + x 2 x 2 y 1 x 0 , x 1 2 + y 0 + y 2 y 2 x 1 y 0 , then the solution of system (6) converges to a period-four solution as following

p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , , p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , .

Proof. By the Theorem 1 and Theorem 3, we can get Theorem 4 holds. Hence, we omit it. □

Theorem 5. Assume that the initial points x i , y i ∈ (0, ∞), i ∈ {− 2, − 1, 0}, x n , y n n = 2 are a positive solution of the system (6). Then the following statements are true:

If y 1 2 + x 0 + x 2 x 2 y 1 x 0 , x 1 2 + y 0 + y 2 y 2 x 1 y 0 , then the solution of system (6) converges to a period-four solution as following:

p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , , p 1 , p 5 p 2 , p 6 p 3 , p 7 p 4 , p 8 , .

Proof. By the Theorem 1 and Theorem 3, we can get Theorem 5 holds. Hence, we omit it. □