^{1}

^{1}

^{*}

^{1}

^{1}

In this paper, we study the behavior of the symmetrical system of rational difference equation:
where A > o and x_{i}, y_{i} ∈(0, ∞), for i= -k,-k+1,…,0.

Recently there has been a great interest in studying difference equations and systems, and quite a lot of papers about the behavior of positive solutions of system of difference equation. We can read references [1-10].

In [

In [

In [

In [

We can see in [1-4], they have the same similar character, which is the system can be reduced into a difference equation with or.

In [

In [

In [

In [

Motivated by systems above, we introduce the symmetrical system:

with parameter, the initial conditions, for, and is a positive integer. We can easily get the system (9) has the unique positive equilibrium.

There are two cases we need to consider:

1) If the initial conditions in the system (9) for, then for all, thus, the system (9) reduces to the difference equation

which was studied by El-owaidy in [

2) If for, then the system (9) is similar to the system in [

In this paper, we try to give some results of the system (9) by using the methods in [

In this section, we give the asymptotic behavior of positive solution to the system (9).

Theorem 2.1. Suppose and is an arbitrary positive solution of the system (9). Then the following statements hold.

1) If k is odd, and, , , for, then

2) If is odd, and, , , for, then

3) If k is even, we can not get some useful results.

Proof: 1) Obviously, we can have

By introduction, we can get

So for,

By limiting the inequality above, we can get

. Similarly, we can also get.

Taking limits on the both sides of the following two equations

we can obtain,.

The proof of 2) is similar, so we omit it.

In this section, we try to get the boundedness, persistence, and periodicity of positive solutions of the system (9).

Theorem 3.1. Suppose A = 1. Then every positive solution of the system (9) is bounded and persists.

Proof. is a positive solution of the system (9).

Obviously, for. So we can get

where, ,

, for.

Then we can obtain

By introduction, we have

Hence, we complete the proof.

Theorem 3.2. Suppose A = 1, is a positive solution of the system (9). Then

Proof: By (10), we can get

By system (9), we can have

which implies

Hence, we can obtain

which can be changed into

Obviously, , we complete the proof.

Theorem 3.3. Suppose.

1) If is odd, then every positive solution of the system (9) with prime period two takes the form

or

with.

2) If is even, there do not exist positive nontrival solution of the system (9) with prime period two.

Proof: 1) As k is odd.

We set is the solution of the system (9) with prime period two. Then there are four positive number such that

If, by the system (9) we can get, which is contradiction with the condition, hence. Similarly, we can get. Then we obtain

From Theorem 3.2, we can get

Next, we consider the following possibilities:

Case 1: Either(I) A < C and B < D or (II) A > C and B > D. Then A = B, C = D.

Case 2: Either(I) A < C and B > D or (II) A > C and B < D. Then A = D, B = C.

Therefore by the system (9), we can get 1) holds.

2) Obviously, if k is even, the system (9) just has trival solution with prime period two.

We complete the proof.

Theorem 4.1. Suppose A > 1. Then every positive solution of the system (9) is bounded and persists.

Proof. Let be a positive solution of the system (9). Obviously, , , for. So we can get

where, ,

, for. Then we can obtain

By introduction, we have

We complete the proof.

Theorem 4.2. Suppose A > 1. Then every positive solution of the system (9) converges to the equilibrium as.

Proof: By (13), we can get

By system (9), we can have

which imply

By the condition, we can get

Besides, and, so we can get

and

i.e.

we complete the proof.