You are currently viewing a new version of our website. To view the old version click .
Symmetry
  • Article
  • Open Access

20 November 2025

On the Solvability of Some Systems of Nonlinear Difference Equations

Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
This article belongs to the Special Issue Advances in Nonlinear Systems and Symmetry/Asymmetry

Abstract

The aim of this paper is to find formulas for the solutions of the nonlinear system of difference equations related to symmetry P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 ± T n 3 ± P n , where the initial conditions P 3 , P 2 , P 1 , P 0 , T 3 , T 2 , T 1 , and T 0 are arbitrary real numbers. Moreover, the theoretical results are verified through several numerical examples, which are simulated and graphically illustrated using mathematical programs.

1. Introduction

Nonlinear difference equations (NDEs) have recently gained significant attention from many researchers. Over the past decade, there has been a notable surge in interest in these types of equations. Their widespread applications across various fields not only in mathematics, but also in related disciplines such as biological sciences, engineering, ecology, discrete-time systems, economics, and physics, may have contributed to this growing fascination. Recent research has examined various aspects of nonlinear dynamics, including local and global behaviors, boundedness, topological classifications, and chaos analysis [1,2,3]. For instance, Khan et al. [4] investigated these dynamics within the framework of a discrete hepatitis C virus model. Similarly, Lei and Han [5] explored the dynamic behavior of a discrete predator–prey model incorporating fear and Allee effects through both theoretical analysis and numerical simulations.
We anticipate that as more intriguing and impactful results are discovered and shared through research, this area will continue to attract the curiosity of scholars in the coming years. The challenge of obtaining closed-form solutions for (NDEs) has become a central topic in this field of research. Many studies have attempted to address NDEs using various analytical and numerical techniques (see, for example, [6,7,8,9,10]), as these equations are often difficult to solve, especially when seeking exact solutions. To overcome this difficulty, several recent approaches have been proposed to transform complex nonlinear difference equations into linear forms, for which well-established solution techniques exist. For instance, a large class of NDEs has been successfully solved in closed form through linearization methods (see, [11,12,13,14]). Numerous researchers have also examined the dynamical behavior of systems of difference equations (SDEs). For example, Çinar analyzed the solutions of a specific SDE in [15], while Karakay et al. [16] demonstrated that certain subclasses of nonlinear two-dimensional SDEs can be solved in closed form. In addition, Halim et al. [17] provided a general formula for the solutions of two-dimensional SDEs, and El-Dessoky [18] explored the existence and periodic nature of such solutions. Khalil and Elsayed [19] studied systems of rational difference equations of various orders, derived explicit solution formulas for these systems, and analyzed their periodic behavior with different periods. Al-Juaid [20] investigated the structural properties of SDE solutions, whereas Alharbi [21] studied the dynamics of three-dimensional nonlinear SDEs, particularly those of fourth order. Alharthi [22] studied higher-order rational difference equation systems, derived their closed-form solutions, and investigated their periodic behavior. Further related studies on NDEs and SDEs can be found in [1,2,23].
Difference equations serve as suitable models for scenarios where population growth occurs in discrete, seasonal intervals with overlapping generations. In this context, researchers have examined the generalized Beverton–Holt stock recruitment model in [24]. Khaliq et al. [25] conducted a dynamical analysis of a discrete-time Lotka–Volterra model involving a system with two predators and one prey. Din and Elsayed [26] examined the boundedness, persistence, and local and global dynamics of a two-directional interacting invasive species model. In [27], the authors conducted a comprehensive study of the local dynamics of a discrete-time COVID-19 epidemic model, focusing on topological classifications, bifurcation analysis, and chaos control. See also [28,29,30].
In this paper, we focus on the following two-dimensional system, and we provide explicit solutions for several specific cases.
P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 ± T n 3 ± P n ,
where n = 0 , 1 , 2 , and the initial conditions P n i and T n i for i { 3 , 2 , 1 , 0 } are arbitrary nonzero real numbers.
The structure of the paper is as follows: Section 2 introduces the system under consideration and outlines the various cases derived from system (1), along with relevant theorems. Section 3 presents numerical simulations that support and validate the theoretical results. Section 4 offers a comprehensive discussion of the findings.

2. The Main Results

2.1. The First Case

In this section, we find the expressions of exact solution of the following system:
P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 T n 3 P n .
Theorem 1.
Suppose that { P n , T n } are solutions of the SDEs (2). Then for n = 0 , 1 , 2 , , the solutions of system (2) can be formed as follows:
P 6 n 3 = D 2 n a n 1 ( a D ) n , T 6 n 3 = d 2 n A n 1 ( A d ) n ,
P 6 n 2 = d 2 n b A n ( A d ) n , T 6 n 2 = D 2 n B a n ( a D ) n ,
P 6 n 1 = D 2 n c a n ( a D ) n , T 6 n 1 = d 2 n C A n ( A d ) n ,
P 6 n = d 2 n + 1 A n ( A d ) n , T 6 n = D 2 n + 1 a n ( a D ) n ,
P 6 n + 1 = D 2 n + 1 B a n ( a D ) n + 1 , T 6 n + 1 = d 2 n + 1 b A n ( A d ) n + 1 ,
P 6 n + 2 = d 2 n + 1 C A n + 1 ( A d ) n , T 6 n + 2 = D 2 n + 1 c a n + 1 ( a D ) n ,
where P 3 = a , P 2 = b , P 1 = c , P 0 = d , T 3 = A , T 2 = B , T 1 = C , and T 0 = D .
Proof. 
The results hold for n = 0 . Now for n > 0 , assume that the results are valid for n 1 , as stated below
P 6 n 9 = D 2 n 2 a n 2 ( a D ) n 1 , T 6 n 9 = d 2 n 2 A n 2 ( A d ) n 1 ,
P 6 n 8 = d 2 n 2 b A n 1 ( A d ) n 1 , T 6 n 8 = D 2 n 2 B a n 1 ( a D ) n 1 ,
P 6 n 7 = D 2 n 2 c a n 1 ( a D ) n 1 , T 6 n 7 = d 2 n 2 C A n 1 ( A d ) n 1 ,
P 6 n 6 = d 2 n 1 A n 1 ( A d ) n 1 , T 6 n 6 = D 2 n 1 a n 1 ( a D ) n 1 ,
P 6 n 5 = D 2 n 1 B a n 1 ( a D ) n , T 6 n 5 = d 2 n 1 b A n 1 ( A d ) n ,
P 6 n 4 = d 2 n 1 C A n ( A d ) n 1 , T 6 n 4 = D 2 n 1 c a n ( a D ) n 1 .
Now, we prove the first relation.
Substituting 6 n 3 into system (2), we get
P 6 n 3 = T 6 n 4 T 6 n 6 P 6 n 7 T 6 n 4 ,
so
P 6 n 3 = D 2 n 1 c a n ( a D ) n 1 D 2 n 1 a n 1 ( a D ) n 1 D 2 n 2 c a n 1 ( a D ) n 1 D 2 n 1 c a n ( a D ) n 1 ;
then,
P 6 n 3 = D 4 n 2 c a n D 2 n 1 c ( a D ) n 1 [ D 1 a 1 ] .
Therefore,
P 6 n 3 = D 2 n a n 1 ( a D ) n .
For equation t 6 n 3 , we can see from (2) that
T 6 n 3 = P 6 n 4 P 6 n 6 T 6 n 7 P 6 n 4 ;
that is,
T 6 n 3 = d 2 n 1 C A n ( A d ) n 1 d 2 n 1 A n 1 ( A d ) n 1 d 2 n 2 C A n 1 ( A d ) n 1 d 2 n 1 C A n ( A d ) n 1 .
Then,
T 6 n 3 = d 4 n 2 C A n d 2 n 1 C ( A d ) n 1 [ d 1 A 1 ] ;
hence,
T 6 n 3 = d 2 n A n 1 ( A d ) n .
For the second formula, substituting 6 n 2 into (2), we get
P 6 n 2 = T 6 n 3 T 6 n 5 P 6 n 6 T 6 n 3 ;
then,
P 6 n 2 = d 2 n A n 1 ( A d ) n d 2 n 1 b A n 1 ( A d ) n d 2 n 1 A n 1 ( A d ) n 1 d 2 n A n 1 ( A d ) n ,
so
P 6 n 2 = d 2 n 1 b ( A d ) 1 A n 1 ( A d ) n d 1 ( A d ) 1 .
Thus,
P 6 n 2 = d 2 n b A n ( A d ) n .
Now for equation T 6 n 2 , from (2) we get
T 6 n 2 = P 6 n 3 P 6 n 5 T 6 n 6 P 6 n 3 ;
that is,
T 6 n 2 = D 2 n a n 1 ( a D ) n D 2 n 1 B a n 1 ( a D ) n D 2 n 1 a n 1 ( a D ) n 1 D 2 n a n 1 ( a D ) n ,
so
T 6 n 2 = D 2 n 1 B ( a D ) 1 a n 1 ( a D ) n D 1 ( a D ) 1 .
Consequently,
T 6 n 2 = D 2 n B a n ( a D ) n ,
Following the same approach, we can verify other forms. The proof is completed. □

2.2. The Second Case

This section is designed to discuss the form of solutions of the following system:
P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 T n 3 P n .
Theorem 2.
Assume that { P n , T n } are solutions of system (3). Then for n 0 , the solutions of system (3) can be formed as follows:
P 12 n 3 = ( 1 ) n D 4 n a n 1 ( a 2 D ) n ( a D ) 2 n , T 12 n 3 = ( 1 ) n d 4 n A 2 n 1 ( A d ) n ( A + d ) n ,
P 12 n 2 = ( 1 ) n d 4 n b A 2 n ( A d ) n ( A + d ) n , T 12 n 2 = ( 1 ) n D 4 n B a n ( a 2 D ) n ( a D ) 2 n ,
P 12 n 1 = ( 1 ) n D 4 n c a n ( a 2 D ) n ( a D ) 2 n , T 12 n 1 = ( 1 ) n d 4 n C A 2 n ( A d ) n ( A + d ) n ,
P 12 n = ( 1 ) n d 4 n + 1 A 2 n ( A d ) n ( A + d ) n , T 12 n = ( 1 ) n D 4 n + 1 a n ( a 2 D ) n ( a D ) 2 n ,
P 12 n + 1 = ( 1 ) n D 4 n + 1 B a n ( a 2 D ) n ( a D ) 2 n + 1 , T 12 n + 1 = ( 1 ) n d 4 n + 1 b A 2 n ( A d ) n + 1 ( A + d ) n ,
P 12 n + 2 = ( 1 ) n + 1 d 4 n + 1 C A 2 n + 1 ( A d ) n ( A + d ) n , T 12 n + 2 = ( 1 ) n D 4 n + 1 c a n ( a 2 D ) n + 1 ( a D ) 2 n ,
P 12 n + 3 = ( 1 ) n + 1 D 4 n + 2 a n ( a 2 D ) n ( a D ) 2 n + 1 , T 12 n + 3 = ( 1 ) n + 1 d 4 n + 2 A 2 n ( A d ) n ( A + d ) n + 1 ,
P 12 n + 4 = ( 1 ) n d 4 n + 2 b A 2 n + 1 ( A d ) n + 1 ( A + d ) n , T 12 n + 4 = ( 1 ) n D 4 n + 2 B a n + 1 ( a 2 D ) n ( a D ) 2 n + 1 ,
P 12 n + 5 = ( 1 ) n D 4 n + 2 c a n ( a 2 D ) n + 1 ( a D ) 2 n + 1 , T 12 n + 5 = ( 1 ) n + 1 d 4 n + 2 C A 2 n + 1 ( A d ) n + 1 ( A + d ) n ,
P 12 n + 6 = ( 1 ) n + 1 d 4 n + 3 A 2 n + 1 ( A d ) n ( A + d ) n + 1 , T 12 n + 6 = ( 1 ) n + 1 D 4 n + 3 a n ( a 2 D ) n + 1 ( a D ) 2 n + 1 ,
P 12 n + 7 = ( 1 ) n + 1 D 4 n + 3 B a n + 1 ( a 2 D ) n ( a D ) 2 n , T 12 n + 7 = ( 1 ) n + 1 d 4 n + 3 b A 2 n + 1 ( A d ) n + 1 ( A + d ) n + 1 ,
P 12 n + 8 = ( 1 ) n + 1 d 4 n + 3 C A 2 n + 2 ( A d ) n + 1 ( A + d ) n , T 12 n + 8 = ( 1 ) n D 4 n + 3 c a n + 1 ( a 2 D ) n + 1 ( a D ) 2 n + 1 .
Proof. 
It is evident that the results hold for the base case n = 0 . Now for n > 0 , assume that the results are valid for n 1 and are stated as follows:
P 12 n 15 = ( 1 ) n 1 D 4 n 4 a n 2 ( a 2 D ) n 1 ( a D ) 2 n 2 , T 12 n 15 = ( 1 ) n 1 d 4 n 4 A 2 n 3 ( A d ) n 1 ( A + d ) n 1 ,
P 12 n 14 = ( 1 ) n 1 d 4 n 4 b A 2 n 2 ( A d ) n 1 ( A + d ) n 1 , T 12 n 14 = ( 1 ) n 1 D 4 n 4 B a n 1 ( a 2 D ) n 1 ( a D ) 2 n 2 ,
P 12 n 13 = ( 1 ) n 1 D 4 n 4 c a n 1 ( a 2 D ) n 1 ( a D ) 2 n 2 , T 12 n 13 = ( 1 ) n 1 d 4 n 4 C A 2 n 2 ( A d ) n 1 ( A + d ) n 1 ,
P 12 n 12 = ( 1 ) n 1 d 4 n 3 A 2 n 2 ( A d ) n 1 ( A + d ) n 1 , T 12 n 12 = ( 1 ) n 1 D 4 n 3 a n 1 ( a 2 D ) n 1 ( a D ) 2 n 2 ,
P 12 n 11 = ( 1 ) n 1 D 4 n 3 B a n 1 ( a 2 D ) n 1 ( a D ) 2 n 1 , T 12 n 11 = ( 1 ) n 1 d 4 n 3 b A 2 n 2 ( A d ) n ( A + d ) n 1 ,
P 12 n 10 = ( 1 ) n d 4 n 3 C A 2 n 1 ( A + d ) n 1 ( A + d ) n 1 , T 12 n 10 = ( 1 ) n 1 D 4 n 3 c a n 1 ( a 2 D ) n ( a D ) 2 n 2 ,
P 12 n 9 = ( 1 ) n D 4 n 2 a n 1 ( a 2 D ) n 1 ( a D ) 2 n 1 , T 12 n 9 = ( 1 ) n d 4 n 2 A 2 n 2 ( A d ) n 1 ( A + d ) n ,
P 12 n 8 = ( 1 ) n 1 d 4 n 2 b A 2 n 1 ( A d ) n ( A + d ) n 1 , T 12 n 8 = ( 1 ) n 1 D 4 n 2 B a n ( a 2 D ) n 1 ( a D ) 2 n 1 ,
P 12 n 7 = ( 1 ) n 1 D 4 n 2 c a n 1 ( a 2 D ) n ( a D ) 2 n 1 , T 12 n 7 = ( 1 ) n d 4 n 2 C A 2 n 1 ( A d ) n ( A + d ) n 1 ,
P 12 n 6 = ( 1 ) n d 4 n 1 A 2 n 1 ( A d ) n 1 ( A + d ) n , T 12 n 6 = ( 1 ) n D 4 n 1 a n 1 ( a 2 D ) n ( a D ) 2 n 1 ,
P 12 n 5 = ( 1 ) n D 4 n 1 B a n ( a 2 D ) n 1 ( a D ) 2 n 2 , T 12 n 5 = ( 1 ) n d 4 n 1 b A 2 n 1 ( A d ) n ( A + d ) n ,
P 12 n 4 = ( 1 ) n d 4 n 1 C A 2 n ( A d ) n ( A + d ) n 1 , T 12 n 4 = ( 1 ) n 1 D 4 n 1 c a n ( a 2 D ) n ( a D ) 2 n 1 .
Now, we will demonstrate the first relation.
Substituting 12 n 3 into system (3), we get
P 12 n 3 = T 12 n 4 T 12 n 6 P 12 n 7 T 12 n 4 ;
then,
P 12 n 3 = ( 1 ) n 1 D 4 n 1 c a n ( a 2 D ) n ( a D ) 2 n 1 ( 1 ) n D 4 n 1 a n 1 ( a 2 D ) n ( a D ) 2 n 1 ( 1 ) n 1 D 4 n 2 c a n 1 ( a 2 D ) n ( a D ) 2 n 1 ( 1 ) n 1 D 4 n 1 c a n ( a 2 D ) n ( a D ) 2 n 1 ,
so
P 12 n 3 = ( 1 ) n D 4 n 1 a n ( a 2 D ) n ( a D ) 2 n 1 [ D 1 a 1 ] .
Therefore,
P 12 n 3 = ( 1 ) n D 4 n a n 1 ( a 2 D ) n ( a D ) 2 n .
For equation T 12 n 3 , we get from (3)
T 12 n 3 = P 12 n 4 P 12 n 6 T 12 n 7 P 12 n 4 ;
that is,
T 12 n 3 = ( 1 ) n d 4 n 1 C A 2 n ( A d ) n ( A + d ) n 1 ( 1 ) n d 4 n 1 A 2 n 1 ( A d ) n 1 ( A + d ) n ( 1 ) n d 4 n 2 C A 2 n 1 ( A d ) n ( A + d ) n 1 ( 1 ) n d 4 n 1 C A 2 n ( A d ) n ( A + d ) n 1 .
Then,
T 12 n 3 = ( 1 ) n d 4 n 1 A 2 n ( A d ) n 1 ( A + d ) n [ d 1 A 1 ] .
Consequently,
T 12 n 3 = ( 1 ) n d 4 n A 2 n 1 ( A d ) n ( A + d ) n .
In a similar way, we can prove the remaining relations. The proof is completed. □

2.3. The Third Case

In this part, we show the formula of solutions for the following nonlinear system:
P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 T n 3 + P n .
Theorem 3.
Suppose that { P n , T n } are solutions of the system (4). Then for n = 0 , 1 , 2 , 3 , , the solutions of system (4) can be formed as follows:
P 12 n 3 = D 4 n a 2 n 1 ( a + D ) n ( a D ) n , T 12 n 3 = d 4 n A n 1 ( A + d ) 2 n ( A + 2 d ) n ,
P 12 n 2 = d 4 n b A n ( A + d ) 2 n ( A + 2 d ) n , T 12 n 2 = D 4 n B a 2 n ( a + D ) n ( a D ) n ,
P 12 n 1 = D 4 n c a 2 n ( a + D ) n ( a D ) n , T 12 n 1 = d 4 n C A n ( A + d ) 2 n ( A + 2 d ) n ,
P 12 n = d 4 n + 1 A n ( A + d ) 2 n ( A + 2 d ) n , T 12 n = D 4 n + 1 a 2 n ( a + D ) n ( a D ) n ,
P 12 n + 1 = D 4 n + 1 B a 2 n ( a + D ) n ( a D ) n + 1 , T 12 n + 1 = d 4 n + 1 b A n ( A + d ) 2 n + 1 ( A + 2 d ) n ,
P 12 n + 2 = d 4 n + 1 C A n ( A + d ) 2 n ( A + 2 d ) n + 1 , T 12 n + 2 = D 4 n + 1 c a 2 n + 1 ( a + D ) n ( a D ) n ,
P 12 n + 3 = D 4 n + 2 a 2 n ( a + D ) n + 1 ( a D ) n , T 12 n + 3 = d 4 n + 2 A n ( A + d ) 2 n + 1 ( A + 2 d ) n ,
P 12 n + 4 = d 4 n + 2 b A n + 1 ( A + d ) 2 n + 1 ( A + 2 d ) n , T 12 n + 4 = D 4 n + 2 B a 2 n + 1 ( a + D ) n ( a D ) n + 1 ,
P 12 n + 5 = D 4 n + 2 c a 2 n + 1 ( a + D ) n ( a D ) n + 1 , T 12 n + 5 = d 4 n + 2 C A n ( A + d ) 2 n + 1 ( A + 2 d ) n + 1 ,
P 12 n + 6 = d 4 n + 3 A n ( A + d ) 2 n + 1 ( A + 2 d ) n + 1 , T 12 n + 6 = D 4 n + 3 a 2 n + 1 ( a + D ) n + 1 ( a D ) n ,
P 12 n + 7 = D 4 n + 3 B a 2 n + 1 ( a + D ) n + 1 ( a D ) n + 1 , T 12 n + 7 = d 4 n + 3 b A n + 1 ( A + d ) 2 n + 2 ( A + 2 d ) n ,
P 12 n + 8 = d 4 n + 3 C A n + 1 ( A + d ) 2 n + 1 ( A + 2 d ) n + 1 , T 12 n + 8 = D 4 n + 3 c a 2 n + 2 ( a + D ) n ( a D ) n + 1 .
Proof. 
See Appendix A

2.4. The Fourth Case

The formula of solutions is explored for the nonlinear system of difference Equation (5) in this section.
P n + 1 = T n T n 2 P n 3 T n , T n + 1 = P n P n 2 T n 3 + P n .
Theorem 4.
Let { P n , T n } be solutions of system (5). Then for n = 0 , 1 , 2 , 3 , , the solutions of system (5) can be formed as follows:
P 6 n 3 = a D 2 n i = 0 n 1 ( a ( 6 i ) D ) ( a ( 6 i + 3 ) D ) , T 6 n 3 = A d 2 n i = 0 n 1 ( A + ( 6 i ) d ) ( A + ( 6 i + 3 ) d ) ,
P 6 n 2 = d 2 n b i = 0 n 1 ( A + ( 6 i + 1 ) d ) ( A + ( 6 i + 4 ) d ) , T 6 n 2 = D 2 n B i = 0 n 1 ( a ( 6 i + 1 ) D ) ( a ( 6 i + 4 ) D ) ,
P 6 n 1 = D 2 n c i = 0 n 1 ( a ( 6 i + 2 ) D ) ( a ( 6 i + 5 ) D ) , T 6 n 1 = d 2 n C i = 0 n 1 ( A + ( 6 i + 2 ) d ) ( A + ( 6 i + 5 ) d ) ,
P 6 n = d 2 n + 1 i = 0 n 1 ( A + ( 6 i + 3 ) d ) ( A + ( 6 i + 6 ) d ) , T 6 n = D 2 n + 1 i = 0 n 1 ( a ( 6 i + 3 ) D ) ( a ( 6 i + 6 ) D ) ,
P 6 n + 1 = D 2 n + 1 B ( a D ) i = 0 n 1 ( a ( 6 i + 4 ) D ) ( a ( 6 i + 7 ) D ) , T 6 n + 1 = d 2 n + 1 b ( A + d ) i = 0 n 1 ( A + ( 6 i + 4 ) d ) ( A + ( 6 i + 7 ) d ) ,
P 6 n + 2 = d 2 n + 1 C ( A + 2 d ) i = 0 n 1 ( A + ( 6 i + 5 ) d ) ( A + ( 6 i + 8 ) d ) , T 6 n + 2 = D 2 n + 1 c ( a 2 D ) i = 0 n 1 ( a ( 6 i + 5 ) D ) ( a ( 6 i + 8 ) D ) .
Proof. 
The results are true for n = 0 . Now for n > 0 , assume the results hold for n 1 and they are given as follows:
P 6 n 9 = a D 2 n 2 i = 0 n 2 ( a ( 6 i ) D ) ( a ( 6 i + 3 ) D ) , T 6 n 9 = A d 2 n 2 i = 0 n 2 ( A + ( 6 i ) d ) ( A + ( 6 i + 3 ) d ) ,
P 6 n 8 = d 2 n 2 b i = 0 n 2 ( A + ( 6 i + 1 ) d ) ( A + ( 6 i + 4 ) d ) , T 6 n 8 = D 2 n 2 B i = 0 n 2 ( a ( 6 i + 1 ) D ) ( a ( 6 i + 4 ) D ) ,
P 6 n 7 = D 2 n 2 c i = 0 n 2 ( a ( 6 i + 2 ) D ) ( a ( 6 i + 5 ) D ) , T 6 n 7 = d 2 n 2 C i = 0 n 2 ( A + ( 6 i + 2 ) d ) ( A + ( 6 i + 5 ) d ) ,
P 6 n 6 = d 2 n 1 i = 0 n 2 ( A + ( 6 i + 3 ) d ) ( A + ( 6 i + 6 ) d ) , T 6 n 6 = D 2 n 1 i = 0 n 2 ( a ( 6 i + 3 ) D ) ( a ( 6 i + 6 ) D ) ,
P 6 n 5 = D 2 n 1 B ( a D ) i = 0 n 2 ( a ( 6 i + 4 ) D ) ( a ( 6 i + 7 ) D ) , T 6 n 5 = d 2 n 1 b ( A + d ) i = 0 n 2 ( A + ( 6 i + 4 ) d ) ( A + ( 6 i + 7 ) d ) ,
P 6 n 4 = d 2 n 1 C ( A + 2 d ) i = 0 n 2 ( A + ( 6 i + 5 ) d ) ( A + ( 6 i + 8 ) d ) , T 6 n 4 = D 2 n 1 c ( a 2 D ) i = 0 n 2 ( a ( 6 i + 5 ) D ) ( a ( 6 i + 8 ) D ) .
We will prove the first formula.
Substituting 6 n 3 into the SDEs (5), we get
P 6 n 3 = T 6 n 4 T 6 n 6 P 6 n 7 T 6 n 4 , P 6 n 3 = D 2 n 1 c ( a 2 D ) i = 0 n 2 ( a ( 6 i + 5 ) D ) ( a ( 6 i + 8 ) D ) D 2 n 1 i = 0 n 2 ( a ( 6 i + 3 ) D ) ( a ( 6 i + 6 ) D ) D 2 n 2 c i = 0 n 2 ( a ( 6 i + 2 ) D ) ( a ( 6 i + 5 ) D ) D 2 n 1 c ( a 2 D ) i = 0 n 2 ( a ( 6 i + 5 ) D ) ( a ( 6 i + 8 ) D ) .
Accordingly,
P 6 n 3 = D 2 n i = 0 n 2 ( a ( 6 i + 3 ) D ) ( a ( 6 i + 6 ) D ) ( a ( 6 n 4 ) D ) D .
Hence,
P 6 n 3 = a D 2 n i = 0 n 1 ( a ( 6 i ) D ) ( a ( 6 i + 3 ) D ) ,
For equation T 12 n 3 , we get from (5)
T 6 n 3 = P 6 n 4 P 6 n 6 T 6 n 7 + P 6 n 4 , T 6 n 3 = d 2 n 1 C ( A 2 d ) i = 0 n 2 ( A + ( 6 i + 5 ) d ) ( A + ( 6 i + 8 ) d ) d 2 n 1 i = 0 n 2 ( A + ( 6 i + 3 ) d ) ( A + ( 6 i + 6 ) d ) d 2 n 2 C i = 0 n 2 ( A + ( 6 i + 2 ) d ) ( A + ( 6 i + 5 ) d ) + d 2 n 1 C ( A + 2 d ) i = 0 n 2 ( A + ( 6 i + 5 ) d ) ( A + ( 6 i + 8 ) d ) ,
T 6 n 3 = d 2 n i = 0 n 2 ( A + ( 6 i + 3 ) d ) ( A + ( 6 i + 6 ) d ) ( A + ( 6 n 4 ) d d ) .
Consequently,
T 6 n 3 = A d 2 n i = 0 n 1 ( A + ( 6 i ) d ) ( A + ( 6 i + 3 ) d ) .
Likewise, we can prove other formulas. The proof is completed. □

3. Numerical Examples

In this section, we provide several interesting numerical examples that validate our earlier theoretical findings and reinforce the correctness of our proofs. Additionally, these examples demonstrate the behavior of various solutions to the nonlinear systems explored in the previous sections. All of the plots (Figure 1, Figure 2, Figure 3 and Figure 4) in this section were generated using MATLAB (R2024b).
Example 1.
Figure 1 shows the behavior of the first system (2) under the random values P 3 = 4.5 , P 2 = 5.1 , P 1 = 6.03 , P 0 = 4.4 , T 3 = 2.7 , T 2 = 6.2 , T 1 = 7.02 , and T 0 = 5.7 .
Figure 1. Representation of behavior of System (2) when P 3 = 4.5 , P 2 = 5.1 , P 1 = 6.03 , P 0 = 4.4 , T 3 = 2.7 , T 2 = 6.2 , T 1 = 7.02 , and T 0 = 5.7 .
Example 2.
In Figure 2, we present the dynamics of the system (3) with the initial conditions P 3 = 4.01 , P 2 = 2.3 , P 1 = 5.6 , P 0 = 1.5 , T 3 = 4.41 , T 2 = 2.07 , T 1 = 3.1 , and T 0 = 16.03 .
Figure 2. Behavior of System (3) with P 3 = 4.01 , P 2 = 2.3 , P 1 = 5.6 , P 0 = 1.5 , T 3 = 4.41 , T 2 = 2.07 , T 1 = 3.1 , and T 0 = 16.03 .
Example 3.
This example illustrates the behavior of the solutions of system (4), which is simulated in Figure 3 using the initial conditions P 3 = 5.6 , P 2 = 6.5 , P 1 = 2 , P 0 = 4.5 , T 3 = 10.5 , T 2 = 4.10 , T 1 = 6.2 , and T 0 = 4.42 .
Figure 3. Expression of the solution of System (4) when P 3 = 5.6 , P 2 = 6.5 , P 1 = 2 , P 0 = 4.5 , T 3 = 10.5 , T 2 = 4.10 , T 1 = 6.2 , and T 0 = 4.42 .
Example 4.
Figure 4 shows that the solution of the fourth system (5) approaches zero as n goes to ∞ with the initial values P 3 = 0.54 , P 2 = 0.44 , P 1 = 0.881 , P 0 = 0.841 , T 3 = 1.5 , T 2 = 0.65 , T 1 = 0.50 , and T 0 = 1 .
Figure 4. Plot of solutions of System (5) with P 3 = 0.54 , P 2 = 0.44 , P 1 = 0.881 , P 0 = 0.841 , T 3 = 1.5 , T 2 = 0.65 , T 1 = 0.50 , and T 0 = 1 .

4. Conclusions

This paper examines the dynamics of nonlinear systems of difference equations, with particular emphasis on fourth-order cases. Our primary goal was to provide analytical solutions for various systems by employing an iterative approach to obtain explicit solution formulas for systems of Equation (1) characterized by recursive relationships. We first found the general solution for system (2) and then obtained the solution formulas for systems (3)–(5). To validate the theoretical findings, numerical simulations were performed and visualized using mathematical software. These simulations demonstrate the accuracy and applicability of the solutions. Overall, the results make a meaningful contribution to the study of nonlinear systems and have significant implications for their applications across various scientific disciplines.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to acknowledge the Deanship of Graduate Studies and Scientific Research, Taif University, for funding this work.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Proof of Theorem 3

Proof. 
The results are true for n = 0 . Now for n > 0 , assume the results hold for n 1 and they are given as follows:
P 12 n 15 = D 4 n 4 a 2 n 3 ( a + D ) n 1 ( a D ) n 1 , T 12 n 15 = d 4 n 4 A n 2 ( A + d ) 2 n 2 ( A + 2 d ) n 1 ,
P 12 n 14 = d 4 n 4 b A n 1 ( A + d ) 2 n 2 ( A + 2 d ) n 1 , T 12 n 14 = D 4 n 4 B a 2 n 2 ( a + D ) n 1 ( a D ) n 1 ,
P 12 n 13 = D 4 n 4 c a 2 n 2 ( a + D ) n 1 ( a D ) n 1 , T 12 n 13 = d 4 n 4 C A n 1 ( A + d ) 2 n 2 ( A + 2 d ) n 1 ,
P 12 n 12 = d 4 n 3 A n 1 ( A + d ) 2 n 2 ( A + 2 d ) n 1 , T 12 n 12 = D 4 n 3 a 2 n 2 ( a + D ) n 1 ( a D ) n 1 ,
P 12 n 11 = D 4 n 3 B a 2 n 2 ( a + D ) n 1 ( a D ) n , T 12 n 11 = d 4 n 3 b A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n 1 ,
P 12 n 10 = d 4 n 3 C A n 1 ( A + d ) 2 n 2 ( A + 2 d ) n , T 12 n 10 = D 4 n 3 c a 2 n 1 ( a + D ) n 1 ( a D ) n 1 ,
P 12 n 9 = D 4 n 2 a 2 n 2 ( a + D ) n ( a D ) n 1 , T 12 n 9 = d 4 n 2 A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n 1 ,
P 12 n 8 = d 4 n 2 b A n ( A + d ) 2 n 1 ( A + 2 d ) n 1 , T 12 n 8 = D 4 n 2 B a 2 n 1 ( a + D ) n 1 ( a D ) n ,
P 12 n 7 = D 4 n 2 c a 2 n 1 ( a + D ) n 1 ( a D ) n , T 12 n 7 = d 4 n 2 C A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n ,
P 12 n 6 = d 4 n 1 A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n , T 12 n 6 = D 4 n 1 a 2 n 1 ( a + D ) n ( a D ) n 1 ,
P 12 n 5 = D 4 n 1 B a 2 n 1 ( a + D ) n ( a D ) n , T 12 n 5 = d 4 n 1 b A n ( A + d ) 2 n ( A + 2 d ) n 1 ,
P 12 n 4 = d 4 n 1 C A n ( A + d ) 2 n 1 ( A + 2 d ) n , T 12 n 4 = D 4 n 1 c a 2 n ( a + D ) n 1 ( a D ) n .
Now, we verify the first form.
Substituting 12 n 3 into the SDEs (4), we get
P 12 n 3 = T 12 n 4 T 12 n 6 P 12 n 7 T 12 n 4 .
Then,
P 12 n 3 = D 4 n 1 c a 2 n ( a + D ) n 1 ( a D ) n D 4 n 1 a 2 n 1 ( a + D ) n ( a D ) n 1 D 4 n 2 c a 2 n 1 ( a + D ) n 1 ( a D ) n D 4 n 1 c a 2 n ( a + D ) n 1 ( a D ) n ;
that is,
P 12 n 3 = D 4 n 1 a 2 n ( a + D ) n ( a D ) n 1 [ D 1 a 1 ] .
Thus,
P 12 n 3 = D 4 n a 2 n 1 ( a + D ) n ( a D ) n .
For equation T 12 n 3 , we get from (4)
T 12 n 3 = P 12 n 4 P 12 n 6 T 12 n 7 + P 12 n 4 ,
T 12 n 3 = d 4 n 1 C A n ( A + d ) 2 n 1 ( A + 2 d ) n d 4 n 1 A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n d 4 n 2 C A n 1 ( A + d ) 2 n 1 ( A + 2 d ) n + d 4 n 1 C A n ( A + d ) 2 n 1 ( A + 2 d ) n ,
so
T 12 n 3 = d 4 n 1 A n ( A + d ) 2 n 1 ( A + 2 d ) n [ d 1 + A 1 ] ;
therefore,
T 12 n 3 = d 4 n A n 1 ( A + d ) 2 n ( A + 2 d ) n .
Similarly, other formulas can be proven. The proof is completed. □

References

  1. Althagafi, H. Dynamics of difference systems: A mathematical study with applications to neural systems. AIMS Math. 2025, 10, 2869–2890. [Google Scholar] [CrossRef]
  2. Alharbi, T.D.; Hasan, M.R. On the Dynamics of Some Higher-Order Nonlinear Difference Equations. Mathematics 2024, 12, 3810. [Google Scholar] [CrossRef]
  3. Ahlbrandt, C.D.; Peterson, A.C. Discrete Hamiltonian Systems: Difference Equations, Continued Fractions, and Riccati Equations; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1996. [Google Scholar]
  4. Khan, A.Q.; Ayesha, Y.; Alsaadi, A. Discrete Hepatitis C virus model with local dynamics, chaos and bifurcations. AIMS Math. 2024, 9, 28643–28670. [Google Scholar] [CrossRef]
  5. Lei, C.; Han, X. Codimension-two bifurcation analysis of a discrete predator–prey system with fear effect and Allee effect. Nonlinear Anal. Model. Control. 2025, 30, 386–404. [Google Scholar] [CrossRef]
  6. Ogul, B.; Simsek, D. On the recursive sequence, Dynamics of Continuous. Discret. Impuls. Syst. Ser. B Appl. Algorithms 2022, 29, 423–435. [Google Scholar]
  7. Folly-Gbetoula, M.; Gocen, M.; Guneysu, M. General form of the solutions of some difference equations via Lie symmetry analysis. J. Anal. Appl. 2022, 20, 105–122. [Google Scholar]
  8. Elsayed, E.M.; AL-Juaid, J.G. The form of solutions and periodic nature for some system of difference equations. Fundam. J. Math. Appl. 2023, 6, 24–34. [Google Scholar] [CrossRef]
  9. Alharbi, T.D.; Elsayed, E.M. The solution expression and the periodicity solution of some nonlinear discrete systems. Pan-Am. J. Math. 2023, 2, 3. [Google Scholar] [CrossRef] [PubMed]
  10. Kara, M. Solvability of a three-dimensional system of nonlinear difference equations. Math. Sci. Appl. E-Notes 2022, 10, 1–15. [Google Scholar] [CrossRef]
  11. Das, S.E.; Bayram, M. On a system of rational difference equations. World Appl. Sci. J. 2010, 10, 1306–1312. [Google Scholar]
  12. Dilip, D.S.; Mathew, S.M. Dynamics of a second order nonlinear difference system with exponents. J. Egypt. Math. Soc. 2021, 29, 1–10. [Google Scholar] [CrossRef]
  13. Elabbasy, E.M.; Eleissawy, S.M. Asymptotic behavior of two dimensional rational system of difference equations. Dyn. Contin. Impuls. Syst. Ser. B Appl. Algorithms 2013, 20, 221–235. [Google Scholar]
  14. Elabbasy, E.M.; El-Metwally, H.; Elsayed, E.M. Global behavior of the solutions of difference equation. Adv. Differ. Equ. 2011, 28, 1–16. [Google Scholar] [CrossRef]
  15. Cinar, C.; Yalcinkaya, I.; Karatas, R. On the positive solutions of the difference equation system xn+1 = m y n , yn+1 = p y n x n 1 y n 1 . J. Inst. Math. Comp. Sci. 2005, 18, 135–136. [Google Scholar]
  16. Karakaya, D.; Yasin, Y.; Kara, M. On A solvable system Of difference equations of sixth-order. Miskolc Math. Notes 2023, 24, 1405–1426. [Google Scholar] [CrossRef]
  17. Halim, Y.; Khelifa, A.; Berkal, M. Representation of solutions of a two-dimensional system of difference equations. Miskolc Math. Notes 2020, 21, 203–218. [Google Scholar] [CrossRef]
  18. El-Dessoky, M.M.; Elsayed, E.M.; Alghamdi, M. Solutions and periodicity for some systems of fourth order rational difference equations. J. Comput. Anal. Appl. 2025, 18, 179–194. [Google Scholar]
  19. Al-Basyouni, K.S.; Elsayed, E.M. On Some Solvable Systems of Some Rational Difference Equations of Third Order. Mathematics 2023, 11, 1047. [Google Scholar] [CrossRef]
  20. Elsayed, E.M.; AL-Juaid, J.G.; Malaikah, H. On the solutions of systems of rational difference equations. J. Progress. Res. Math. 2022, 19, 49–59. [Google Scholar] [CrossRef]
  21. Alharbi, T.D.; AL-Juaid, J.G. On the dynamics of some three-dimensional systems of difference equations. Axioms 2025, 14, 371. [Google Scholar] [CrossRef]
  22. Alharthi, M.T. On the solutions of some systems of rational difference equations. AIMS Math. 2024, 9, 30320–30347. [Google Scholar] [CrossRef]
  23. Almatra, M.B.; Elsayed, E.M. Solutions and formulae for some systems of difference equations. MathLAB J. 2018, 1, 356–369. [Google Scholar]
  24. Beverton, R.J.; Holt, S.J. On the Dynamics of Exploited Fish Populations; Fish Invest: London, UK, 1957; p. 19. [Google Scholar]
  25. Khaliq, A.; Ibrahim, T.F.; Alotaibi, A.M.; Shoaib, M.; El-Moneam, M. Dynamical analysis of discrete-time two-predators one-Prey Lotka–Volterra model. Mathematics 2022, 10, 4015. [Google Scholar] [CrossRef]
  26. Din, Q.; Elsayed, E.M. Stability analysis of a discrete ecological. Model. Comput. Ecol. Softw. 2014, 4, 89–103. [Google Scholar]
  27. Khan, A.Q.; Tasneem, M.; Younis, B.; Ibrahim, T.F. Dynamical analysis of a discrete-time COVID-19 epidemic model. Math. Meth. Appl. Sci. 2022, 46, 4789–4814. [Google Scholar] [CrossRef]
  28. Al-Khedhairi, A.; Elsadany, A.A.; Elsonbaty, A. On the dynamics of a discrete fractional-order cournot–bertrand competition duopoly game. Math. Probl. Eng. 2022, 2022, 8249215. [Google Scholar] [CrossRef]
  29. Ibrahim, T.F. Asymptotic behavior of a difference equation model in exponential form. Math. Methods Appl. Sci. 2022, 45, 10736–10748. [Google Scholar] [CrossRef]
  30. Khaliq, A.; Mustafa, I.; Ibrahim, T.F.; Osman, W.M.; Al-Sinan, B.R.; Dawood, A.A.; Juma, M.Y. Stability and bifurcation analysis of fifth-order nonlinear fractional difference equation. Fractal Fract. 2023, 7, 113. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Article metric data becomes available approximately 24 hours after publication online.