Next Article in Journal
Ascoli-Type Theorem for Baire 1 Functions
Next Article in Special Issue
Codimension-Two Bifurcations of a Simplified Discrete-Time SIR Model with Nonlinear Incidence and Recovery Rates
Previous Article in Journal
Two New Matrix Classes Related to the CMP Inverse: CMP and Co-CMP Matrices
Previous Article in Special Issue
Analytical Contribution to a Cubic Functional Integral Equation with Feedback Control on the Real Half Axis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamics and Solutions of Higher-Order Difference Equations

by
Mensah Folly-Gbetoula
School of Mathematics, University of the Witwatersrand, Johannesburg 2000, South Africa
Mathematics 2023, 11(17), 3693; https://doi.org/10.3390/math11173693
Submission received: 30 July 2023 / Revised: 24 August 2023 / Accepted: 25 August 2023 / Published: 28 August 2023
(This article belongs to the Special Issue Advances in Differential Analysis and Functional Analysis)

Abstract

:
The invariance method, known as Lie analysis, consists of finding a group of transformations that leave a difference equation invariant. This powerful tool permits one to lower the order, linearize and more importantly, obtain analytical solutions of difference and differential equations. In this study, we obtain the solutions and periodic solutions for some family of difference equations. We achieve this by performing an invariance analysis of this family. Eventually, symmetries are derived and used to construct canonical coordinates required for the derivation of the solutions. Moreover, periodic aspects of these solutions and the stability character of the equilibrium points are investigated.
MSC:
39A10; 39A13; 39A23; 39A05; 39A99

1. Introduction

In certain cases, difference equations are used to model the evolution of natural phenomena occurring over time. The analysis of difference equations has attracted the attention of many researchers and interesting results have been obtained. The type of difference equations where initial conditions and parameters appearing in the equations are fuzzy numbers, known as fuzzy difference equations, have also been studied and progress has been made [1,2]. In numerous articles that dealt with solutions of difference equations, we noticed the use of proof by induction to show that the presented formulas for the solutions are valid. To the best of our knowledge, the use of Lie analysis to obtain analytic solutions to difference equations is to some extent new. This method, originally applied to differential equations, has recently been applied to difference equations. It traces back to the twentieth century when Maeda [3] proved that, as long as a difference equation admits symmetries, its order can be reduced. Recently, it has been shown, for differential equations, that when symmetries and conservation laws are associated, one may proceed to double reduction [4]. It is now known that this approach works for difference equations [5]. With regard to differential equations, computer packages that generate Lie symmetries have been developed. Regrettably, this is not the case for difference equations. Symmetries of difference equations are mostly computed by hand and frequently involve cumbersome computations.
In this study, unlike in many articles where the change of variables is made by guess work, we employ symmetries to reduce the order of the difference equation
x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( A n + B n x n x n + k x n + 2 k x n + 3 k ) ,
via canonical coordinates. We clearly state the link between the symmetries (characteristics) and the new variable (invariant). Note that in (1), A n and B n are real sequences and x i , i = 0 , 1 , , 6 k 1 are the initial conditions. As a matter of choice, some authors prefer the equivalent form
x n = x n 6 k x n 5 k x n 4 k x n 2 k x n k ( a n + b n x n 6 k x n 5 k x n 4 k x n 3 k )
of (1). Studies of special cases of (2) can be found in the literature [6] where the authors consider the equation
x n = x n 6 x n 5 x n 4 x n 2 x n 1 ( a + b x n 6 x n 5 x n 4 x n 3 )
and presented the formula for solutions as well as their asymptotic behavior. For similar studies on difference equations of this form, the reader can refer to [5,6,7,8,9,10,11,12].
The paper is organized as follows. In Section 2, we provide some basic theory needed for finding symmetries of difference equations and the reduction of order. We also discuss some well-known theory on the stability of equilibrium points. In Section 3, we obtain symmetries and solutions of (1). A more detailed study is conducted for some special cases. Section 4 is mainly dedicated to the stability of the equilibrium points and the periodicity aspects of the solutions of (1). Finally, in Section 5, we show that some existing results in the literature are special cases of our findings.

2. Preliminaries

The algorithm for finding symmetries of difference equations is explained at large in [13]. Consider an equation involving some continuous variables x = ( x 1 , , x q ) and a local diffeomorphism (point transformation): T : x x ¯ ( x ) .
Definition 1.
A parameterized set of transformations
T ε ( x ) x ^ ( x ; ε )
is a one-parameter local Lie group of transformations if the following conditions are satisfied:
1.
T 0 is the identity map, so that x ^ = x when ε = 0 .
2.
T γ T ε = T γ + ε for every γ , ε sufficiently close to 0.
3.
Every x ^ α can be represented as a Taylor series in ε, that is,
x ^ α ( x ; ε ) = x α + ε η α ( x ) + O ( ε 2 ) , α = 0 , 1 , , q .
Definition 2.
The infinitesimal generator of the one-parameter Lie group of point transformations (4) is the operator
X = X ( x ) = η ( x ) · Δ = α = 1 q η α ( x ) x α ,
and Δ is the gradient operator.
Theorem 1
([13]).  F ( x ) is invariant under the group of transformations (4) if and only if X F ( x ) = 0 .
Suppose a difference equation has the form
x n + 6 k = A ( n , x n , x n + k , x n + 2 k , x n + 3 k , x n + 4 k , x n + 5 k ) ,
where A is a known function that satisfies A / x n 0 . As said before, we explore a one-parameter Lie group of point transformations
x ^ n = x n + ε η ( n , x n )
where ε represents the group parameter. The function η = η ( n , x n ) is referred to as the characteristic of the Lie group. The infinitesimal generator takes the form
X = η ( n , x n ) x n .
Although the transformation depends on n and x n only, one needs to investigate how the symmetries affect the other variables appearing in the right hand side of (6), hence the introduction of the prolonged infinitesimal generator X of X :
X = η ( n , x n ) x n + η ( n + k , x n + k ) x n + k + η ( n + 2 k , x n + 2 k ) x n + 2 k + η ( n + 3 k , x n + 3 k ) x n + 3 k + η ( n + 4 k , x n + 4 k ) x n + 4 k + η ( n + 5 k , x n + 5 k ) x n + 5 k
admitted by the group of transformations (7). Accordingly, the infinitesimal condition for invariance is given by η ( n + 6 k , x n + 6 ) X ( A ) = 0 , that is,
η ( n + 6 k , x n + 6 ) A x n + 5 k η ( n + 5 k , x n + 5 k ) A x n + 4 k η ( n + 4 k , x n + 4 k ) A x n + 3 k η ( n + 3 k , x n + 3 k ) A x n + 2 k η ( n + 2 k , x n + 2 k ) A x n + k η ( n + k , x n + k ) A x n η ( n , x n ) = 0
on condition that (6) is satisfied. The functional Equation (9) can be solved for Q after a set of lengthy computations.
The analysis of stability of the equilibrium points will be carried out using the following definitions and theorems. They can be found in [14].
Definition 3.
The equilibrium point x ¯ of (6) is stable (locally) if for all ϵ > 0 , δ > 0 such that i = 0 6 k 1 | x i x ¯ | < δ | x n x ¯ | < ϵ for all solution { x n } n = 0 of (6).
Definition 4.
The equilibrium point x ¯ of (6) is a global attractor if x n x ¯ , as n , for any solution { x n } n = 0 of (6).
Definition 5.
The equilibrium point x ¯ of (6) is globally asymptotically stable if x ¯ is locally stable and is a global attractor of (6).
We introduce the characteristic equation of (6) of the fixed point x ¯ :
λ 6 k p 5 k λ 5 k p 4 k λ 4 k p 3 k λ 3 k p 2 k λ 2 k p k λ k p 0 = 0
where p i = A x n + i ( x ¯ , , x ¯ ) , i = 0 , k , 2 k , 3 k , 4 k , 5 k .
Theorem 2
([14]). Suppose A is a smooth function defined on some neighborhood of x ¯ . Then,
(i)
If all the roots, λ i , of (10) are such that | λ i | < 1 , then x ¯ is locally asymptotically stable.
(ii)
If at least one root of (10) has absolute value greater than one, then x ¯ is unstable.
Definition 6.
The equilibrium point x ¯ of (6) is called non-hyperbolic if there exists a root of (10) with absolute value equal to one.
Theorem 3
([14]). Assume p 0 , p k , p 2 k , p 4 k and p 5 k are real numbers such that
| p 0 | + | p k | + | p 2 k | + | p 3 k | + | p 4 k | + | p 5 k | < 1 .
Then, the roots of (10) lie inside the open unit disk | λ | < 1 .

3. Symmetries and Solutions

To find symmetries for (1), we apply the condition (9) to (1) as follows:
η ( n + 6 k , A ) + x n x n + k x n + 2 k x n + 4 k η n + 5 k , x n + 5 k + x n x n + k x n + 2 k x n + 5 k η n + 4 k , x n + 4 k x n + 4 k 2 x n + 5 k 2 A n + B n x n x n + k x n + 2 k x n + 3 k + B n x n 2 x n + k 2 x n + 2 k 2 η n + 3 k , x n + 3 k x n + 4 k x n + 5 k A n + B n x n x n + k x n + 2 k x n + 3 k 2 A n x n x n + k η n + 2 k , x n + 2 k x n + 4 k x n + 5 k A n + B n x n x n + k x n + 2 k x n + 3 k 2 A n x n x n + k η n + k , x n + k x n + 4 k x n + 5 k A n + B n x n x n + k x n + 2 k x n + 3 k 2 A n x n + k x n + 2 k η n , x n x n + 4 k x n + 5 k A n + B n x n x n + k x n + 2 k x n + 3 k 2 = 0 .
We differentiate (11) with respect to x n viewing x n + 4 k as a function of x n , x n + k , x n + 2 k , x n + 3 k , x n + 5 k and A . To put it in another way, we apply the differential operator x n ( A , x n / A , x n + 4 k ) x n + 4 k to (11) to obtain (after clearing fractions except for the reciprocal of x n ):
x n + 4 k ( A n + B n x n x n + k x n + 2 k x n + 3 k ) η ( n + 4 k , x n + 4 k ) ( A n + B n x n x n + k x n + 2 k x n + 3 k ) η ( n + 4 k , x n + 4 k ) + B n x n x n + k x n + 2 k x n + 4 k η ( n + 3 k , x n + 3 k ) + B n x n x n + k x n + 3 k x n + 4 k η ( n + 2 k , x n + 2 k ) + B n x n x n + 2 k x n + 3 k x n + 4 k η ( n + k , x n + k ) x n + 4 k ( A n + B n x n x n + k x n + 2 k x n + 3 k ) η ( n , x n ) + x n + 4 k A n x n + 2 B n x n + k x n + 2 k x n + 3 k η ( n , x k ) = 0 .
Observe that A , x denotes the derivative of A with respect to x and represents the derivative with regard to the continuous variable. Next, we differentiate (12) with respect to x n and we utilize the method of separation to obtain the following system:
x n x n + k x n + 2 k x n + 3 k x n + 4 k : η = 0 x n + 4 k : η 1 x n η + 2 x n 2 η 2 x n 3 η = 0 .
It is easy to verity that the general solution of the above system is given by
η n , u n = λ n u n 2 + θ n u n
for some arbitrary functions λ n and θ n depending on n. We replace (14) and the corresponding shifts in (11) ( x n + 6 k must also be replaced by its expression in (1)). Clearing fractions and separating with respect to products of x n + i , the resulting system of equations reduces to the constraints:
λ n = 0 ,
θ n + θ n + k + θ n + 2 k + θ n + 3 k = 0 .
The constraint in (16) is a homogeneous linear difference equation with characteristic equation r 3 k + r 2 k + r k + 1 = 0 whose solutions are e i π + 4 p π 2 k , e i 2 π + 4 p π 2 k and e i 3 π + 4 p π 2 k for p = 0 , , k 1 . Solutions of (16) take the form r n and using (8), we have 3 k symmetries given by
X 1 p = e i n π + 4 p π 2 k x n x n , X 2 p = e i n 2 π + 4 p π 2 k x n x n , X 3 p = e i n 3 π + 4 p π 2 k x n x n ,
p = 0 , 1 , , k 1 . We construct the canonical coordinate as
S n = d x n θ n x n = 1 θ n ln | x n |
and we set
| V n | = exp { ( S n θ n + S n + k θ n + k + S n + 2 k θ n + 2 k + S n + 3 k θ n + 3 k ) } .
The variable V n can take the form
V n = 1 x n x n + k x n + 2 k x n + 3 k
and, as a matter of fact, is an invariant because
X ( V n ) = θ n x n x n + θ n + k x n + k x n + k + θ n + 2 k x n + 2 k x n + 2 k + θ n + 3 k x n + 3 k x n + 3 k + θ n + 4 k x n + 4 k x n + 4 k + θ n + 5 k x n + 5 k x n + 5 k V n = 1 x n x n + k x n + 2 k x n + 3 k θ n + θ n + k + θ n + 2 k + θ n + 3 k = 0 .
Using (1) and (20), we derive the following relations:
V n + 3 k = A n V n + B n
and
x n + 4 k = V n V n + k x n
from which are obtained
V 3 k n + j = V j k 1 = 0 n 1 A 3 k k 1 + j + m = 0 n 1 B 3 k m + j k 2 = m + 1 n 1 A 3 k k 2 + j , j = 0 , 1 , , 3 k 1 ,
and
x 4 k n + j = x j s = 0 n 1 V 4 k s + j V 4 k s + k + j , j = 0 , 1 , , 4 k 1
using simple iterations. Since we do not have an expression for V 4 k s + i , we make use of (25) to obtain the following:
x 12 k n + j = x j s = 0 3 n 1 V 4 k s + j V 4 k s + k + j = x j s = 0 n 1 V 12 k s + j V 12 k s + k + j V 12 k s + 4 k + j V 12 k s + 4 k + k + j V 12 k s + 8 k + j V 12 k s + 8 k + k + j = x j s = 0 n 1 r = 0 2 V 12 k s + 4 k r + j V 12 k s + 4 k r + k + j = x j s = 0 n 1 r = 0 2 V 3 k 4 s + 4 k r + j 3 k + τ ( 4 k r + j ) V 3 k 4 s + 4 k r + k + j 3 k + τ ( 4 k r + k + j ) , j = 0 , 1 , , 12 k 1 .
Observe that the symbol · represents the floor function and τ ( q ) is the remainder after division of q by 3 k . It follows that 0 τ ( p ) 3 k 1 . Employing (24) in (26), we find that
x 12 k n + j = x j s = 0 n 1 r = 0 2 V τ ( 4 k r + j ) k 1 = 0 4 s 1 + 4 k r + j 3 k A 3 k k 1 + τ ( 4 k r + j ) + m = 0 4 s 1 + 4 k r + j 3 k B 3 k m + τ ( 4 k r + j ) k 2 = m + 1 4 s 1 + 4 k r + j 3 k A 3 k k 2 + τ ( 4 k r + j ) V τ ( 4 k r + k + j ) k 1 = 0 4 s 1 + 4 k r + k + j 3 k A 3 k k 1 + τ ( 4 k r + k + j ) + m = 0 4 s 1 + 4 k r + k + j 3 k B 3 k m + τ ( 4 k r + k + j ) k 2 = m + 1 4 s 1 + 4 k r + k + j 3 k A 3 k k 2 + τ ( 4 k r + k + j )
where V i = 1 / ( x i x i + k x i + 2 k x i + k ) . Equation (27) gives the solution to the difference Equation (1). Naturally, the solution of (2) is deduced from that of (1) by backshifting it 6 k times. So, using (27), the solution of (2) reads
x 12 k n 6 k + j = x j 6 k s = 0 n 1 r = 0 2 v τ ( 4 k r + j ) k 1 = 0 4 s 1 + 4 k r + j 3 k a 3 k k 1 + τ ( 4 k r + j ) + m = 0 4 s 1 + 4 k r + j 3 k b 3 k m + τ ( 4 k r + j ) k 2 = m + 1 4 s 1 + 4 k r + j 3 k a 3 k k 2 + τ ( 4 k r + j ) v τ ( 4 k r + k + j ) k 1 = 0 4 s 1 + 4 k r + k + j 3 k a 3 k k 1 + τ ( 4 k r + k + j ) + m = 0 4 s 1 + 4 k r + k + j 3 k b 3 k m + τ ( 4 k r + k + j ) k 2 = m + 1 4 s 1 + 4 k r + k + j 3 k a 3 k k 2 + τ ( 4 k r + k + j )
where v i = 1 / ( x i 6 k x i 5 k x i 4 k x i 5 k ) . For 1, k, 3 k -periodic sequences A n and B n , the solutions simplifies considerably. The following subsection is dedicated to the case where A n and B n are 1-periodic.

3.1. The Case A n and B n Are 1-Periodic Sequences

Letting A n = A and B n = B in (27), we obtain
x 12 k n + j = x j s = 0 n 1 V τ ( j ) A 4 s + j 3 k + B m = 0 4 s 1 + j 3 k A m V τ ( j + k ) A 4 s + j + k 3 k + B m = 0 4 s 1 + j + k 3 k A m V τ ( j + k ) A 4 s + 1 + j + k 3 k + B m = 0 4 s + j + k 3 k A m V τ ( j + 2 k ) A 4 s + 1 + j + 2 k 3 k + B m = 0 4 s + j + 2 k 3 k A m   V τ ( j + 2 k ) A 4 s + 2 + j + 2 k 3 k + B m = 0 4 s + 1 + j + 2 k 3 k A m V τ ( j ) A 4 s + 3 + j 3 k + B m = 0 4 s + 2 + j 3 k A m   = x j s = 0 n 1 A 4 s + j 3 k + B V τ ( j ) m = 0 4 s + j 3 k 1 A m A 4 s + 3 + j 3 k + B V τ ( j ) m = 0 4 s + 2 + j 3 k A m A 4 s + 1 + j + k 3 k + B V τ ( j + k ) m = 0 4 s + j + k 3 k A m A 4 s + j + k 3 k + B V τ ( j + k ) m = 0 4 s + j + k 3 k 1 A m × A 4 s + 2 + j + 2 k 3 k + B V τ ( j + 2 k ) m = 0 4 s + 1 + j + 2 k 3 k A m A 4 s + 1 + j + 2 k 3 k + B V τ ( j + 2 k ) m = 0 4 s + j + 2 k 3 k A m ,
j = 0 , 1 , , 12 k 1 . However, j = 0 , 1 , , 12 k 1 can take the form j = 3 k r + p k + j 1 with r = 0 , 1 , 2 , 3 ; p = 0 , 1 , 2 ; j 1 = 0 , 1 , , k 1 . Consequently,
x 12 k n + 3 k r + k p + j 1 = x 3 k r + k p + j 1 s = 0 n 1 A 4 s + r + B V p k + j 1 m = 0 4 s + r 1 A m A 4 s + 3 + r + B V p k + j 1 m = 0 4 s + 2 + r A m A 4 s + 1 + r + j 1 + ( p + 1 ) k 3 k + B V τ ( j 1 + ( p + 1 ) k ) m = 0 4 s + r + j 1 + ( p + 1 ) k 3 k A m A 4 s + r + j 1 + ( p + 1 ) k 3 k + B V τ ( j 1 + ( p + 1 ) k ) m = 0 4 s + r 1 j 1 + ( p + 1 ) k 3 k A m A 4 s + 2 + r + j 1 + ( p + 2 ) k 3 k + B V τ ( j 1 + ( p + 2 ) k ) m = 0 4 s + 1 + r + j + ( p + 2 ) k 3 k A m A 4 s + 1 + r + j 1 + ( p + 2 ) k 3 k + B V τ ( j 1 + ( p + 2 ) k ) m = 0 4 s + r + j 1 + ( p + 2 ) k 3 k A m .
More explicitly,
x 12 k n + 3 k r + j 1 = x 3 k r + j 1 s = 0 n 1 A 4 s + r + B V j 1 m = 0 4 s + r 1 A m A 4 s + 3 + r + B V j 1 m = 0 4 s + 2 + r A m A 4 s + 1 + r + B V j 1 + k m = 0 4 s + r A m A 4 s + r + B V j 1 + k m = 0 4 s + r 1 A m A 4 s + 2 + r + B V j 1 + 2 k m = 0 4 s + 1 + r A m A 4 s + 1 + r + B V j 1 + 2 k m = 0 4 s + r A m , x 12 k n + 3 k r + k + j 1 = x 3 k r + k + j 1 s = 0 n 1 A 4 s + r + B V j 1 + k m = 0 4 s + r 1 A m A 4 s + 3 + r + B V j 1 + k m = 0 4 s + 2 + r A m A 4 s + 1 + r + B V j 1 + 2 k m = 0 4 s + r A m A 4 s + r + 2 + B V j 1 + 2 k m = 0 4 s + r + 1 A m A 4 s + 3 + r + B V j 1 m = 0 4 s + 2 + r A m A 4 s + 2 + r + B V j 1 m = 0 4 s + r + 1 A m ,
x 12 k n + 3 k r + 2 k + j 1 = x 3 k r + 2 k + j 1 s = 0 n 1 A 4 s + r + B V j 1 + 2 k m = 0 4 s + r 1 A m A 4 s + 3 + r + B V j 1 + 2 k m = 0 4 s + 2 + r A m A 4 s + 2 + r + B V j 1 m = 0 4 s + r + 1 A m A 4 s + r + 1 + B V j 1 m = 0 4 s + r A m A 4 s + 3 + r + B V j 1 + k m = 0 4 s + 2 + r A m A 4 s + 2 + r + B V j 1 + k m = 0 4 s + r + 1 A m ,
for r = 0 , 1 , 2 , 3 ; j 1 = 0 , 1 , , k 1 with V n = 1 / ( x n x n + k x n + 2 k x n + 3 ) . Equations in (31) are given in terms of the first 12 k terms including the initial conditions. Since one of the aims of the paper is to present the solution in closed-form, we use (1) to provide the expressions of x i , i = 6 k + 1 , , 12 k 1 , as follows:
x 6 k + j 1 = x j 1 x j 1 + k x j 1 + 2 k x j 1 + 4 k x j 1 + 5 k A + B V j 1 , x 7 k + j 1 = x 3 k + j 1 x j 1 + 4 k A + B V j 1 x j 1 A + B V j 1 + k , x 8 k + j 1 = x 4 k + j 1 x j 1 + 5 k A + B V j 1 + k x k + j 1 A + B V j 1 + 2 k , x 9 k + j 1 = x j 1 x j 1 + k A + B V j 1 + 2 k x j 1 + 4 k A 2 + ( A + 1 ) B V j 1 , x 10 k + j 1 = x j 1 + k x j 1 + 2 k A 2 + ( A + 1 ) B V j 1 x j 1 + 5 k A + B V j 1 A 2 + ( A + 1 ) B V j 1 + k , x 11 k + j 1 = x j 1 + 3 k x j 1 + 4 k x j 1 + 5 k A + B V j 1 A 2 + ( A + 1 ) B V j 1 + k x j 1 x j 1 + k A + B V j 1 + k A 2 + ( A + 1 ) B V j 1 + 2 k ,
for j 1 = 0 , 1 , , k 1 .

3.1.1. The Case When A 1

If A 1 , (31) simplifies to
x 12 k n + 3 k r + j 1 = x 3 k r + j 1 s = 0 n 1 A 4 s + r + B V j 1 1 A 4 s + r 1 A A 4 s + 3 + r + B V j 1 1 A 4 s + r + 3 1 A A 4 s + 1 + r + B V j 1 + k 1 A 4 s + r + 1 1 A A 4 s + r + B V j 1 + k 1 A 4 s + r 1 A A 4 s + 2 + r + B V j 1 + 2 k 1 A 4 s + r + 2 1 A A 4 s + 1 + r + B V j 1 + 2 k 1 A 4 s + r + 1 1 A , x 12 k n + 3 k r + k + j 1 = x 3 k r + k + j 1 s = 0 n 1 A 4 s + r + B V j 1 + k 1 A 4 s + r 1 A A 4 s + 3 + r + B V j 1 + k 1 A 4 s + r + 3 1 A A 4 s + 1 + r + B V j 1 + 2 k 1 A 4 s + r + 1 1 A A 4 s + r + 2 + B V j 1 + 2 k 1 A 4 s + r + 2 1 A A 4 s + 3 + r + B ( 1 A 4 s + r + 3 ) V j 1 ( 1 A ) A 4 s + 2 + r + B ( 1 A 4 s + r + 2 ) V j 1 ( 1 A ) ,
x 12 k n + 3 k r + 2 k + j 1 = x 3 k r + 2 k + j 1 s = 0 n 1 A 4 s + r + B V j 1 + 2 k 1 A 4 s + r 1 A A 4 s + 3 + r + B V j 1 + 2 k 1 A 4 s + r + 3 1 A A 4 s + 2 + r + B V j 1 1 A 4 s + r + 2 1 A A 4 s + r + 1 + B V j 1 1 A 4 s + r + 1 1 A   A 4 s + 3 + r + B ( 1 A 4 s + r + 3 ) V j 1 + k ( 1 A ) A 4 s + 2 + r + B ( 1 A 4 s + r + 2 ) V j 1 + k ( 1 A )
with x 6 k , , x 12 k 1 given in (32).
The case A = 1 : For this case, after simplification, we have that
x 12 k n + j 1 = x j 1 1 + B V j 1 + k n 1 + B V j 1 n 1 + B V j 1 + 2 k n , x 12 k n + k + j 1 = x k + j 1 1 + B V j 1 + 2 k n 1 + B V j 1 n 1 + B V j 1 + k n ,
x 12 k n + 2 k + j 1 = x 2 k + j 1 1 + B V j 1 + k n 1 + B V j 1 n 1 + B V j 1 + 2 k n , x 12 k n + 3 k + j 1 = x 3 k + j 1 1 + B V j 1 + 2 k n 1 + B V j 1 n 1 + B V j 1 + k n , x 12 k n + 4 k + j 1 = x 4 k + j 1 1 + B V j 1 + k n 1 + B V j 1 n 1 + B V j 1 + 2 k n , x 12 k n + 5 k + j 1 = x 5 k + j 1 1 + B V j 1 + 2 k n 1 + B V j 1 n 1 + B V j 1 + k n , x 12 k n + 6 k + j 1 = x j 1 x j 1 + k x j 1 + 2 k 1 + B V j 1 + k n x 4 k + j 1 x j 1 + 5 k 1 + B V j 1 n + 1 1 + B V j 1 + 2 k n , x 12 k n + 7 k + j 1 = x j 1 + 3 k x j 1 + 4 k 1 + B V j 1 + 2 k n x j 1 1 + B V j 1 + k n + 1 1 + B V j 1 ( n + 1 ) , x 12 k n + 8 k + j 1 = x j 1 + 4 k x j 1 + 5 k 1 + B V j 1 + k n + 1 x j 1 + k 1 + B V j 1 n 1 + B V j 1 + 2 k n + 1 , x 12 k n + 9 k + j 1 = x j 1 x j 1 + k 1 + B V j 1 + k n x j 1 + 4 k 1 + B V j 1 n 1 + B V j 1 + 2 k n 1 , x 12 k n + 10 k + j 1 = x j 1 + k x j 1 + 2 k 1 + B V j 1 + 2 k n x j 1 + 5 k 1 + B V j 1 + k n 1 + B V j 1 ( n 1 ) , x 12 k n + 11 k + j 1 = x j 1 + 3 k x j 1 + 4 k x j 1 + 5 k 1 + B V j 1 + k n 1 x j 1 x j 1 + k 1 + B V j 1 n 1 1 + B V j 1 + 2 k n ,
for j 1 = 0 , 1 , , k 1 .

3.1.2. The Case When A = 1

If A = 1 , Equation (31) reduces to
x 12 k n + 3 k r + j 1 = x 3 k r + j 1 s = 0 n 1 1 + ( 4 s + r ) B V j 1 1 + ( 4 s + r + 3 ) B V j 1 1 + ( 4 s + r + 1 ) B V j 1 + k 1 + ( 4 s + r ) B V j 1 + k 1 + ( 4 s + r + 2 ) B V j 1 + 2 k 1 + ( 4 s + r + 1 ) B V j 1 + 2 k
x 12 k n + 3 k r + k + j 1 = x 3 k r + k + j 1 s = 0 n 1 1 + ( 4 s + r ) B V j 1 + k 1 + ( 4 s + r + 3 ) B V j 1 + k 1 + ( 4 s + r + 1 ) B V j 1 + 2 k 1 + ( 4 s + r + 2 ) B V j 1 + 2 k 1 + ( 4 s + r + 3 ) B V j 1 1 + ( 4 s + r + 2 ) B V j 1 x 12 k n + 3 k r + 2 k + j 1 = x 3 k r + 2 k + j 1 s = 0 n 1 1 + B ( 4 s + r ) V j 1 + 2 k 1 + B ( 4 s + r + 3 ) V j 1 + 2 k 1 + ( 4 s + r + 2 ) B V j 1 1 + ( 4 s + r + 1 ) B V j 1 1 + ( 4 s + r + 3 ) B V j 1 + k 1 + ( 4 s + r + 2 ) B V j 1 + k
with x 6 k , , x 12 k 1 given in equations in (32). These equations in (35) can be unpacked and presented in the following closed-form:
x 12 k n + j 1 = x j 1 s = 0 n 1 1 + ( 4 s ) B V j 1 1 + ( 4 s + 3 ) B V j 1 1 + ( 4 s + 1 ) B V j 1 + k 1 + ( 4 s ) B V j 1 + k 1 + ( 4 s + 2 ) B V j 1 + 2 k 1 + ( 4 s + 1 ) B V j 1 + 2 k x 12 k n + k + j 1 = x k + j 1 s = 0 n 1 1 + ( 4 s ) B V j 1 + k 1 + ( 4 s + 3 ) B V j 1 + k 1 + ( 4 s + 1 ) B V j 1 + 2 k 1 + ( 4 s + 2 ) B V j 1 + 2 k 1 + ( 4 s + 3 ) B V j 1 1 + ( 4 s + 2 ) B V j 1 x 12 k n + 2 k + j 1 = x 2 k + j 1 s = 0 n 1 1 + ( 4 s ) B V j 1 + 2 k 1 + ( 4 s + 3 ) B V j 1 + 2 k 1 + ( 4 s + 2 ) B V j 1 1 + ( 4 s + 1 ) B V j 1 1 + ( 4 s + 3 ) B V j 1 + k 1 + ( 4 s + 2 ) B V j 1 + k x 12 k n + 3 k + j 1 = x j 1 + 3 k s = 0 n 1 1 + ( 4 s + 1 ) B V j 1 1 + ( 4 s + 4 ) B V j 1 1 + ( 4 s + 2 ) B V j 1 + k 1 + ( 4 s + 1 ) B V j 1 + k 1 + ( 4 s + 3 ) B V j 1 + 2 k 1 + ( 4 s + 2 ) B V j 1 + 2 k x 12 k n + 4 k + j 1 = x 4 k + j 1 s = 0 n 1 1 + ( 4 s + 1 ) B V j 1 + k 1 + ( 4 s + 4 ) B V j 1 + k 1 + ( 4 s + 2 ) B V j 1 + 2 k 1 + ( 4 s + 3 ) B V j 1 + 2 k 1 + ( 4 s + 4 ) B V j 1 1 + ( 4 s + 3 ) B V j 1 x 12 k n + 5 k + j 1 = x 5 k + j 1 s = 0 n 1 1 + ( 4 s + 1 ) B V j 1 + 2 k 1 + ( 4 s + 4 ) B V j 1 + 2 k 1 + ( 4 s + 3 ) B V j 1 1 + ( 4 s + 2 ) B V j 1 1 + ( 4 s + 4 ) B V j 1 + k 1 + ( 4 s + 3 ) B V j 1 + k x 12 k n + 6 k + j 1 = x j 1 x j 1 + k x j 1 + 2 k x j 1 + 4 k x j 1 + 5 k ( 1 + B V j 1 ) s = 0 n 1 1 + ( 4 s + 2 ) B V j 1 1 + ( 4 s + 5 ) B V j 1 1 + ( 4 s + 3 ) B V j 1 + k 1 + ( 4 s + 2 ) B V j 1 + k 1 + ( 4 s + 4 ) B V j 1 + 2 k 1 + ( 4 s + 3 ) B V j 1 + 2 k x 12 k n + 7 k + j 1 = x 3 k + j 1 x j 1 + 4 k ( 1 + B V j 1 ) x j 1 ( 1 + B V j 1 + k ) s = 0 n 1 1 + ( 4 s + 2 ) B V j 1 + k 1 + ( 4 s + 5 ) B V j 1 + k 1 + ( 4 s + 3 ) B V j 1 + 2 k 1 + ( 4 s + 4 ) B V j 1 + 2 k 1 + ( 4 s + 5 ) B V j 1 1 + ( 4 s + 4 ) B V j 1 x 12 k n + 8 k + j 1 = x 4 k + j 1 x j 1 + 5 k ( 1 + B V j 1 + k ) x k + j 1 ( 1 + B V j 1 + 2 k ) s = 0 n 1 1 + ( 4 s + 2 ) B V j 1 + 2 k 1 + ( 4 s + 5 ) B V j 1 + 2 k 1 + ( 4 s + 4 ) B V j 1 1 + ( 4 s + 3 ) B V j 1 1 + ( 4 s + 5 ) B V j 1 + k 1 + ( 4 s + 4 ) B V j 1 + k x 12 k n + 9 k + j 1 = x j 1 x j 1 + k ( 1 + B V j 1 + 2 k ) x j 1 + 4 k ( 1 + 2 B V j 1 ) s = 0 n 1 1 + ( 4 s + 3 ) B V j 1 1 + ( 4 s + 6 ) B V j 1 1 + ( 4 s + 4 ) B V j 1 + k 1 + ( 4 s + 3 ) B V j 1 + k 1 + ( 4 s + 5 ) B V j 1 + 2 k 1 + ( 4 s + 4 ) B V j 1 + 2 k x 12 k n + 10 k + j 1 = x j 1 + k x j 1 + 2 k ( 1 + 2 B V j 1 ) x j 1 + 5 k ( 1 + B V j 1 ) ( 1 + 2 B V j 1 + k ) s = 0 n 1 1 + ( 4 s + 3 ) B V j 1 + k 1 + ( 4 s + 6 ) B V j 1 + k 1 + ( 4 s + 4 ) B V j 1 + 2 k 1 + ( 4 s + 5 ) B V j 1 + 2 k 1 + ( 4 s + 6 ) B V j 1 1 + ( 4 s + 5 ) B V j 1 x 12 k n + 11 k + j 1 = x j 1 + 3 k x j 1 + 4 k x j 1 + 5 k ( 1 + B V j 1 ) ( 1 + 2 B V j 1 + k ) x j 1 x j 1 + k ( 1 + B V j 1 + k ) ( 1 + 2 B V j 1 + 2 k ) s = 0 n 1 1 + ( 4 s + 3 ) B V j 1 + 2 k 1 + ( 4 s + 6 ) B V j 1 + 2 k 1 + ( 4 s + 5 ) B V j 1 1 + ( 4 s + 4 ) B V j 1 1 + ( 4 s + 6 ) B V j 1 + k 1 + ( 4 s + 5 ) B V j 1 + k
for j 1 = 0 , 1 , , k 1 with V i = 1 / ( x i x i + k x i + 2 k x i + 3 k ) .

4. Periodicity and Behavior of the Solutions

Here, we study the periodicity of the solutions via the formula of the solutions obtained in the previous section and we look at stability of the equilibrium points.
Theorem 4.
The solution x n of
x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( A + B x n x n + k x n + 2 k x n + 3 k ) ,
where A 1 and B 0 are real constants, is 4 k -periodic if and only if the initial conditions, x i , satisfy the following conditions:
(i) 
x i = x i + 4 k .
(ii) 
x i x i + k x i + 2 k x n + 3 k = ( 1 A ) / B .
(iii) 
x i x i + k or x i x i + 2 k .
Proof. 
Suppose the initial conditions x 0 , , x 6 k 1 satisfy x i = x i + 4 k with x i x i + k x i + 2 k x i + 3 k = ( 1 A ) / B . The last condition eliminates k and 2 k -periodicities. Now, thanks to condition ( i ) , (31) and (32), we have
x 4 k + i = x i , i = 0 , , 2 k 1 ; x 6 k + i = x i + 2 k , i = 0 , , 6 k 1 ; x 12 k n + i = x i , i = 0 , , 12 k 1 .
This implies that x n = x n + 4 k for all n and the solution is periodic with period 4 k . □
Figure 1 shows the graph of (37) for k = 2 with the initial conditions satisfying the three conditions in Theorem 4. As expected, the solution is 8-periodic.
Figure 2 shows the graph of (37) for k = 2 with the initial conditions not satisfying one of the three conditions in Theorem 4, condition ( i i ) to be specific.
Theorem 5.
The solution x n of (37) is 2 k -periodic if and only if the initial conditions, x i , satisfy the following conditions:
(i) 
x i = x i + 2 k
(ii) 
x i 2 x i + k 2 = ( 1 A ) / B
(iii) 
x i x i + k .
Proof. 
Suppose the initial conditions satisfy x i = x i + 2 k and x i 2 x i + k 2 = ( 1 A ) / B . Condition ( i i i ) eliminates k-periodicity. Invoking condition ( i ) , (31) and (32), we have that
x 2 k + i = x i , i = 0 , , 4 k 1 ; x 6 k + i = x i , i = 0 , , 6 k 1 ; x 12 k n + i = x i , i = 0 , , 12 k 1 .
Therefore, x n = x n + 2 k for all n and the solution is periodic with period 2 k . □
Figure 3 shows the graph of (37) for k = 2 with the initial conditions satisfying the three conditions in Theorem 5. As expected, the solution is 4-periodic.
Figure 4 shows the graph of (37) for k = 2 with the initial conditions not satisfying condition ( i i ) in Theorem 5.
Note that the solution x n of (37) is not k-periodic when the initial conditions satisfy x i = x i + k and x i 4 = ( 1 A ) / B . In this case, we have a constant sequence. Nevertheless, all the initial conditions being the same does not guarantee the existence of 1-periodic (constant) sequences. We illustrate this in Figure 5 and Figure 6.

5. Concluding Remarks

Although Equations (1) and (2) are the same, the solution of the later equation is obtained by backshifting the solution of the first equation 6 k times. For example, when k = 1 and for constant coefficients, (2) becomes
x n = x n 6 x n 5 x n 4 x n 2 x n 1 ( A + B x n 6 x n 5 x n 4 x n 3 )
and its solution, using (33) and (35), is given by (after backshifting 6 times and remembering that, in this case, 1 / V i = x i x i + 1 x i + 2 x i + 3 )
x 12 k n + 3 r 6 = x 3 r 6 s = 0 n 1 A 4 s + r ( 1 A B V 6 ) + B V 6 A 4 s + 3 + r ( 1 A B V 6 ) + B V 6 A 4 s + 1 + r ( 1 A B V 5 ) + B V 5 A 4 s + r ( 1 A B V 5 ) + B V 5 A 4 s + 2 + r ( 1 A B V 4 ) + B V 4 A 4 s + 1 + r ( 1 A B V 4 ) + B V 4
x 12 k n + 3 r 5 = x 3 r 5 s = 0 n 1 A 4 s + r ( 1 A B V 5 ) + B V 5 A 4 s + 3 + r ( 1 A B V 5 ) + B V 5 A 4 s + 1 + r ( 1 A B V 4 ) + B V 4 A 4 s + r + 2 ( 1 A B V 4 ) + B V 4 A 4 s + 3 + r ( 1 A B V 6 ) + B V 6 A 4 s + 2 + r ( 1 A B V 6 ) + B V 6
x 12 n + 3 r 4 = x 3 r 4 s = 0 n 1 A 4 s + r ( 1 A B V 4 ) + B V 4 A 4 s + 3 + r ( 1 A B V 4 ) + B V 4 A 4 s + 2 + r ( 1 A B V 6 ) + B V 6 A 4 s + r + 1 ( 1 A B V 6 ) + B V 6 A 4 s + 3 + r ( 1 A B V 5 ) + B V 5 A 4 s + 2 + r ( 1 A B V 5 ) + B V 5
when a 1 ; and
x 12 n + 3 r 6 = x 3 r 6 s = 0 n 1 1 + B V 6 4 s + r 1 + B V 6 4 s + r + 3 1 + B V 5 4 s + r + 1 1 + B V 5 4 s + r 1 + B V 4 4 s + r + 2 1 + B V 4 4 s + r + 1
x 12 n + 3 r 5 = x 3 r 5 s = 0 n 1 1 + B V 5 4 s + r 1 + B V 5 4 s + r + 3 1 + B V 4 4 s + r + 1 1 + B V 4 4 s + r + 2 1 + B V 6 4 s + r + 3 1 + B V 6 4 s + r + 2
x 12 n + 3 r 4 = x 3 r 4 s = 0 n 1 1 + B V 4 4 s + r 1 + B V 4 4 s + r + 3 1 + B V 6 4 s + r + 2 1 + B V 6 4 s + r + 1 1 + B V 5 4 s + r + 3 1 + B V 5 4 s + r + 2
when a = 1 . This special case was studied in [6]. In fact, setting n : = n + 1 and r + 2 : = j yields Theorem 2.1 and Corollaries 2.2 and 2.3 in [6].

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Alijani, Z.; Tchier, F. On the fuzzy difference equation of higher order. J. Comput. Complex. Appl. 2017, 3, 44–49. [Google Scholar]
  2. Khastan, A.; Alijani, Z. On the new solutions to the fuzzy difference equation xn+1=A+B/xn. Fuzzy Sets Syst. 2019, 358, 64–83. [Google Scholar] [CrossRef]
  3. Maeda, S. The similarity method for difference equations. IMA J. Appl. Math. 1987, 38, 129–134. [Google Scholar] [CrossRef]
  4. Kara, A.H.; Mahomed, F.M. Relationship between symmetries and conservation laws. Int. J. Theor. Phys. 2000, 39, 23–40. [Google Scholar] [CrossRef]
  5. Ndlovu, L.; Folly-Gbetoula, M.; Kara, A.H.; Love, A. Symmetries, Associated First Integrals, and Double Reduction of Difference Equations. Abstr. Appl. Anal. 2014, 2014, 490165. [Google Scholar] [CrossRef]
  6. Yazlik, Y.; Gungor, M. On the solvable of nonlinear difference equation of sixth-order. J. Sci. Arts 2019, 2, 399–414. [Google Scholar]
  7. Kara, M.; Yazlik, Y. On the solutions of the three-dimensional system of difference equations via recursive relations of order two and applications. J. Appl. Anal. Comput. 2022, 12, 736–753. [Google Scholar] [CrossRef]
  8. Almatrafi, M.B.; Alzubaidis, M. The solution and dynamic behaviour of some difference equations of seventh order. J. Appl. Nonlinear Dyn. 2021, 10, 709–719. [Google Scholar] [CrossRef]
  9. Folly-Gbetoula, M.; Mkhwanazi, K.; Nyirenda, D. On a study of a family of higher order recurrence relations. Math. Probl. Eng. 2022, 2022, 6770105. [Google Scholar] [CrossRef]
  10. Elsayed, E.M.; Ibrahim, T.F. Solutions and Periodicity of a Rational Recursive Sequences of Order Five. Bull. Malays. Math. Sci. Soc. 2015, 38, 95–112. [Google Scholar] [CrossRef]
  11. Folly-Gbetoula, M.; Nyirenda, D. A generalised two-dimensional system of higher order recursive sequences. J. Differ. Equ. Appl. 2020, 26, 244–260. [Google Scholar] [CrossRef]
  12. Mnguni, N.; Nyirenda, D.; Folly-Gbetoula, M. Symmetry Lie Algebra and Exact Solutions of Some fourth-order Difference Equation. J. Nonlinear Sci. Appl. 2018, 11, 1262–1270. [Google Scholar] [CrossRef]
  13. Hydon, P.E. Difference Equations by Differential Equation Methods; Cambridge University Press: Cambridge, UK, 2014. [Google Scholar]
  14. Grove, E.A.; Ladas, G. Periodicities in Nonlinear Difference Equations; Chapman & Hall/CRC: Boca Raton, FL, USA, 2005; Volume 4. [Google Scholar]
Figure 1. x n + 12 = x n x n + 2 x n + 4 x n + 8 x n + 10 ( 2 + 0.5 x n x n + 2 x n + 4 x n + 6 ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 4 ,   x 5 = 4 ,   x 6 = 2 ,   x 7 = 2 ,   x 9 = 1 / 2 ,   x 11 = 1 / 2 .
Figure 1. x n + 12 = x n x n + 2 x n + 4 x n + 8 x n + 10 ( 2 + 0.5 x n x n + 2 x n + 4 x n + 6 ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 4 ,   x 5 = 4 ,   x 6 = 2 ,   x 7 = 2 ,   x 9 = 1 / 2 ,   x 11 = 1 / 2 .
Mathematics 11 03693 g001
Figure 2. x n + 12 = x n x n + 2 x n + 4 x n + 8 x n + 10 ( 2 + 5 x n x n + 2 x n + 4 x n + 6 ) with x 0 = 1 ,   x 1 = 1 / 2 ,   x 2 = 1 / 4 ,   x 3 = 1 / 2 ,   x 4 = 4 ,   x 5 = 4 ,   x 6 = 2 ,   x 7 = 2 ,   x 8 = 1 ,   x 9 = 1 / 2 ,   x 10 = 1 / 4 ,   x 11 = 1 / 2 .
Figure 2. x n + 12 = x n x n + 2 x n + 4 x n + 8 x n + 10 ( 2 + 5 x n x n + 2 x n + 4 x n + 6 ) with x 0 = 1 ,   x 1 = 1 / 2 ,   x 2 = 1 / 4 ,   x 3 = 1 / 2 ,   x 4 = 4 ,   x 5 = 4 ,   x 6 = 2 ,   x 7 = 2 ,   x 8 = 1 ,   x 9 = 1 / 2 ,   x 10 = 1 / 4 ,   x 11 = 1 / 2 .
Mathematics 11 03693 g002
Figure 3. x n + 12 = x n x n + 2 x n + 2 x n + 8 x n + 10 ( 2 16 x n x n + 2 x n + 4 x n + 6 ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 1 ,   x 5 = 1 / 2 ,   x 6 = 1 / 4 ,   x 7 = 1 / 2 .
Figure 3. x n + 12 = x n x n + 2 x n + 2 x n + 8 x n + 10 ( 2 16 x n x n + 2 x n + 4 x n + 6 ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 1 ,   x 5 = 1 / 2 ,   x 6 = 1 / 4 ,   x 7 = 1 / 2 .
Mathematics 11 03693 g003
Figure 4. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 6 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 1 ,   x 5 = 1 / 2 ,   x 6 = 1 / 4 ,   x 7 = 1 / 2 .
Figure 4. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 6 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 8 = 1 ,   x 1 = x 9 = 1 / 2 ,   x 2 = x 10 = 1 / 4 ,   x 3 = x 11 = 1 / 2 ,   x 4 = 1 ,   x 5 = 1 / 2 ,   x 6 = 1 / 4 ,   x 7 = 1 / 2 .
Mathematics 11 03693 g004
Figure 5. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 16 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 1 = x 2 = x 3 = x 4 = x 5 = x 6 = x 7 = x 8 = x 9 = x 10 = x 11 = 1 not satisfying x i 4 = ( 1 A ) / B .
Figure 5. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 16 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 1 = x 2 = x 3 = x 4 = x 5 = x 6 = x 7 = x 8 = x 9 = x 10 = x 11 = 1 not satisfying x i 4 = ( 1 A ) / B .
Mathematics 11 03693 g005
Figure 6. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 1 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 1 = x 2 = x 3 = x 4 = x 5 = x 6 = x 7 = x 8 = x 9 = x 10 = x 11 = 1 satisfying x i 4 = ( 1 A ) / B .
Figure 6. x n + 6 k = x n x n + k x n + 2 k x n + 4 k x n + 5 k ( 2 1 x n x n + k x n + 2 k x n + 3 k ) with x 0 = x 1 = x 2 = x 3 = x 4 = x 5 = x 6 = x 7 = x 8 = x 9 = x 10 = x 11 = 1 satisfying x i 4 = ( 1 A ) / B .
Mathematics 11 03693 g006
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.

Share and Cite

MDPI and ACS Style

Folly-Gbetoula, M. Dynamics and Solutions of Higher-Order Difference Equations. Mathematics 2023, 11, 3693. https://doi.org/10.3390/math11173693

AMA Style

Folly-Gbetoula M. Dynamics and Solutions of Higher-Order Difference Equations. Mathematics. 2023; 11(17):3693. https://doi.org/10.3390/math11173693

Chicago/Turabian Style

Folly-Gbetoula, Mensah. 2023. "Dynamics and Solutions of Higher-Order Difference Equations" Mathematics 11, no. 17: 3693. https://doi.org/10.3390/math11173693

APA Style

Folly-Gbetoula, M. (2023). Dynamics and Solutions of Higher-Order Difference Equations. Mathematics, 11(17), 3693. https://doi.org/10.3390/math11173693

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop