# Almost periodic dynamics of a discrete Nicholson’s blowflies model involving a linear harvesting term

## Abstract

We consider a discrete Nicholson’s blowflies model involving a linear harvesting term. Under appropriate assumptions, sufficient conditions are established for the existence and exponential convergence of positive almost periodic solutions of this model. To expose the effectiveness of the main theorems, we support our result by a numerical example.

MSC:39A11.

## 1 Introduction

In , Gurney et al. proposed the following nonlinear autonomous delay equation:

$x ′ (t)=−αx(t)+βx(t−τ) e − λ x ( t − τ ) ,α,β,τ,λ∈(0,∞)$
(1.1)

to describe the population of the Australian sheep blowfly and to agree with the experimental data obtained by Nicholson in . Here $x(t)$ is the size of the population at time t, β is the maximum per capita daily egg production, $1/λ$ is the size at which the blowfly population reproduces at its maximum rate, α is the per capita daily adult death rate, and τ is the generation time. Equation (1.1) is recognized in the literature as Nicholson’s blowflies model. The dynamical behavior of solutions of this model and its various modifications have been extensively studied by many authors during the last couple of decades. For more details, we suggest to the readers that they consult .

Biologists have proposed that the process of harvesting population is of great significance in the exploitation of biological resources, i.e., in fishery, forestry and wildlife management. This justification has attracted the attention of many mathematicians who are interested in studying the dynamic behavior of population models governed by differential or difference equations [19, 20]. In their recent paper , in particular, Berezansky et al. have put forward a question about the asymptotic behavior of the well-known Nicholson’s blowflies model involving a linear harvesting term of the form

$x ′ (t)=−αx(t)+βx(t−τ) e − λ x ( t − τ ) −Hx(t−σ),α,β,τ,λ,σ,H∈(0,∞).$
(1.2)

Recently, there have appeared many results concerning the investigation of periodic and almost periodic behaviors of system (1.2) via employing several utilities such as fixed-point theorems and the coincidence degree theory [2225, 27, 28].

The delay difference equation

$Δx(n)=−αx(n)+βx(n−τ) e − γ x ( n − τ ) ,α,β,τ,λ∈(0,∞)$

is a discrete analogue of the delay differential equation (1.1). For the purpose of convenience, however, we shall consider a discrete Nicholson’s blowflies model involving a linear harvesting term of the form

$Δx(n)=−α(n)x(n+1)+β(n)x ( n − τ ( n ) ) e − γ ( n ) x ( n − τ ( n ) ) −H(n)x ( n − σ ( n ) ) ,$
(1.3)

where $n∈Z$ and $α,β,γ,τ,σ,H:Z→[0,∞)$ are almost periodic sequences.

A primary purpose of this paper is to study the almost periodic dynamics of equation (1.3). We shall employ the contraction mapping principle to establish sufficient conditions for the existence of an almost periodic solution for (1.3). By constructing an appropriate Lyapunov functional, we also prove that the solutions of (1.3) converge exponentially to an almost periodic solution. We provide a numerical example to illustrate the effectiveness of the main theorems. To the best of authors’ knowledge, no paper regarding the investigation of almost periodicity of equation (1.3) has been published. Thus, our paper is different and presents a new approach.

## 2 Preliminaries

For a bounded sequence g defined on $Z$, we define $g +$ and $g −$ as follows:

$g + = lim sup n → ∞ g(n)and g − = lim inf n → ∞ g(n).$

In the sequel, we assume that

$α − >0, β − >0, γ − >0$
(2.1)

and

$r=max { τ + , σ + } >0.$
(2.2)

Let $I={−r,−r+1,…,−1,0}$, $C={φ:I→Z}$ and $C + ={φ∈C:φ≥0,φ(0)>0}$. For each $φ∈C$, we define the norm of φ as $∥ φ ∥ 0 = max s ∈ I |φ|$. Denote $x n =x(n+s)$ for all $s∈I$. For any $φ∈ C +$, it is easy to see that there is a unique solution $x(n,0,φ)$ of (1.3) with

$x 0 =φ$
(2.3)

and $x(n,0,φ)>0$ for all $n∈Z$.

Definition 1 A sequence $f(n)$ is said to be almost periodic if for $ϵ>0$, there is a constant $l(ϵ)>0$ such that in any interval of length $l(ϵ)$ there exists a number $τ ¯ ∈Z$ such that the inequality

$|f(n+ τ ¯ )−f(n)|<ϵ$

is satisfied for all $n∈Z$.

The following basic results are essential for proving the main results in Section 3. They were provided in  for arbitrary time scale $T$. If $T=Z$, then these results can be formulated as follows.

Theorem 1 ()

Let $f:Z→R$ be an almost periodic sequence, then $f(n)$ is bounded on $Z$.

Theorem 2 ()

If $f,g:Z→R$ are almost periodic sequences, then $f+g$ and fg are almost periodic.

Theorem 3 ()

If $f:Z→R$ is an almost periodic sequence, then $F(n)$ is almost periodic if and only if $F(n)$ is bounded on $Z$ where $F(n)= ∑ k = 0 n − 1 f(k)$.

Theorem 4 ()

If $f:Z→R$ is an almost periodic sequence and $F(⋅)$ is defined on the value field of $f(n)$, then $F∘f$ is almost periodic.

We assume that

A.1 There exist two constants $Γ 1$ and $Γ 2$ such that

$Γ 1 > Γ 2 , ( β γ ) + 1 α − e < Γ 1 and β − α + Γ 1 e − γ + Γ 1 − H + Γ 1 α + > Γ 2 ≥ 1 γ − .$

The following result tells that every solution of (1.3) persists.

Lemma 1 Let A.1 hold. Then for $φ∈ C 0 :={φ: Γ 2 <φ(n)< Γ 1 ,∀n∈I}$, the solution $x(n, n 0 ,φ)$ of (1.3) and (2.3) satisfy

$Γ 2
(2.4)

Proof Set $x(n)=x(n, n 0 ,φ)$. Let $[ n 0 ,T)⊆[ n 0 ,∞)$ be an interval such that

$x(n)>0,∀n∈[ n 0 ,T).$
(2.5)

We claim that

$0
(2.6)

For the sake of contradiction, we assume that (2.6) is not true. Then, one can find $n 1 ∈( n 0 ,T)$ such that

$x( n 1 +1)≥ Γ 1 and0
(2.7)

In view of (1.3), A.1, (2.7) and the fact that $sup u ≥ 0 u e − u = 1 e$, we have

$0 ≤ Δ x ( n 1 ) = − α ( n 1 ) x ( n 1 + 1 ) + β ( n 1 ) x ( n 1 − τ ( n 1 ) ) e − γ ( n 1 ) x ( n 1 − τ ( n 1 ) ) − H ( n 1 ) x ( n 1 − σ ( n 1 ) ) = − α ( n 1 ) x ( n 1 + 1 ) + β ( n 1 ) γ ( n 1 ) γ ( n 1 ) x ( n 1 − τ ( n 1 ) ) e − γ ( n 1 ) x ( n 1 − τ ( n 1 ) ) − H ( n 1 ) x ( n 1 − σ ( n 1 ) ) ≤ − α − x ( n 1 + 1 ) + ( β γ ) + 1 e ≤ α − [ − Γ 1 + ( β γ ) + 1 α − e ] < 0 ,$

which is a contradiction, and this implies that (2.6) holds. Next, we show that

$x(n)> Γ 2 ,∀n∈[ n 0 ,T).$
(2.8)

On the contrary, assume that there exists $n 2 ∈( n 0 ,T)$ such that

$x( n 2 +1)≤ Γ 2 ,andx(n)> Γ 2 ,∀n∈[ n 0 −r, n 2 +1).$
(2.9)

In virtue of A.1 and (2.6), we obtain

$Γ 2
(2.10)

In view of (1.3), A.1, (2.9), (2.10) and the fact that $min 1 ≤ u ≤ δ u e − u =δ e − δ$, we have

$0 ≥ Δ x ( n 2 ) = − α ( n 2 ) x ( n 2 + 1 ) + β ( n 2 ) x ( n 2 − τ ( n 2 ) ) e − γ ( n 2 ) x ( n 2 − τ ( n 2 ) ) − H ( n 2 ) x ( n 2 − σ ( n 2 ) ) = − α ( n 2 ) x ( n 2 + 1 ) + β ( n 2 ) γ ( n 2 ) γ ( n 2 ) x ( n 2 − τ ( n 2 ) ) e − γ ( n 2 ) x ( n 2 − τ ( n 2 ) ) − H ( n 2 ) x ( n 2 − σ ( n 2 ) ) ≥ − α + Γ 2 + β − γ + γ + Γ 1 e − γ + Γ 1 − H + Γ 1 ≥ α + [ − Γ 2 + β − α + Γ 1 e − γ + Γ 1 − H + Γ 1 α + ] > 0 ,$

which is a contradiction, and this implies that (2.8) holds. In view of (2.6) and (2.8), it follows that relation (2.4) is true. Hence the proof is complete. □

## 3 The main results

Consider the linear difference system

$x(n+1)=A(n)x(n),$
(3.1)

where $x∈ Z m$, and $A:Z→ Z m × m$ is a matrix sequence. In what follows, we denote by $∥⋅∥$ any convenient norm either of a vector or of a matrix.

Definition 2 The difference system (3.1) is said to possess an exponential dichotomy on $Z$ if there exists a projection P, that is, an $m×m$ matrix P such that $P 2 =P$, and constants $K>0$, $ν>0$ such that

$∥ X ( r ) P X − 1 ( s + 1 ) ∥ ≤ K ( 1 1 + ν ) r − s − 1 , r ≥ s , ∥ X ( r ) ( I − P ) X − 1 ( s + 1 ) ∥ ≤ K ( 1 1 + ν ) s + 1 − r , s ≥ r ,$

where $X(t)$ is the fundamental solution matrix of (3.1) and $r,s∈Z$.

Consider the following almost periodic difference system:

$x(n+1)=A(n)x(n)+f(n),$
(3.2)

where $A:Z→ Z m × m$ is an almost periodic matrix sequence and $f:Z→ Z m$ is an almost periodic vector sequence.

Theorem 5 If the linear system (3.1) admits an exponential dichotomy, then system (3.2) has a bounded solution $x(n)$ in the form

$x(n)= ∑ k = − ∞ n − 1 X(n)P X − 1 (k+1)f(k)− ∑ k = n ∞ X(n)(I−P) X − 1 (k+1)f(k),$
(3.3)

where $X(t)$ is the fundamental solution matrix of (3.1).

Proof By direct substitution, we obtain

$x ( n + 1 ) − A ( n ) x ( n ) = ∑ k = − ∞ n X ( n + 1 ) P X − 1 ( k + 1 ) f ( k ) − ∑ k = n + 1 ∞ X ( n + 1 ) X − 1 ( k + 1 ) f ( k ) + ∑ k = n + 1 ∞ X ( n + 1 ) P X − 1 ( k + 1 ) f ( k ) − A ( n ) ∑ k = − ∞ n − 1 X ( n ) P X − 1 ( k + 1 ) f ( k ) + A ( n ) ∑ k = n ∞ X ( n ) X − 1 ( k + 1 ) f ( k ) − A ( n ) ∑ k = n ∞ X ( n ) P X − 1 ( k + 1 ) f ( k ) .$

It follows that

$x ( n + 1 ) − A ( n ) x ( n ) = X ( n + 1 ) P X − 1 ( n + 1 ) f ( n ) − A ( n ) X ( n ) P X − 1 ( n + 1 ) f ( n ) + A ( n ) X ( n ) X − 1 ( n + 1 ) f ( n ) = f ( n ) .$

Moreover, we have

$∥ x ( n ) ∥ = sup n ∈ Z | ∑ k = − ∞ n − 1 X ( n ) P X − 1 ( k + 1 ) f ( k ) − ∑ k = n ∞ X ( n ) ( I − P ) X − 1 ( k + 1 ) f ( k ) | ≤ sup n ∈ Z ( | ∑ k = − ∞ n − 1 X ( n ) P X − 1 ( k + 1 ) | + | ∑ k = n ∞ X ( n ) ( I − P ) X − 1 ( k + 1 ) | ) K ∥ f ∥ ≤ ( | ∑ k = − ∞ n − 1 ( 1 1 + ν ) n − k − 1 | + | ∑ k = n ∞ ( 1 1 + ν ) k + 1 − n | ) K ∥ f ∥ ≤ ( 1 + ν ν + 1 ν ) K ∥ f ∥ = 2 + ν ν K ∥ f ∥ ,$

where $∥⋅∥= sup t ∈ Z |⋅|$. By Theorem 1, $x(n)$ is a bounded solution of system (3.2). The proof is complete. □

Theorem 6 ()

Let $α(n)>0$ be an almost periodic sequence on $Z$ and

$inf n ∈ Z α ( n ) 1 + α ( n ) >0,$
(3.4)

then the linear system

$Δx(n)=−α(n)x(n+1)$
(3.5)

admits an exponential dichotomy on $Z$.

Set

If we define the norm $∥ φ ∥ B$ =$sup n ∈ Z |φ(n)|$, for any $φ∈B$, then one can easily deduce that $B$ is a Banach space.

We assume that

A.2 $β + α − 1 e 2 + H + α − <1$.

Theorem 7 Let A.1 and A.2 hold. Then, there exists a unique positive almost periodic solution of (1.3) in $B ∗ :={φ:φ∈B, Γ 2 <φ(n)< Γ 1 ,∀n∈Z}$.

Proof For any $ϕ∈B$, we consider an auxiliary equation

$Δx(n)=−α(n)x(n+1)+β(n)ϕ ( n − τ ( n ) ) e − γ ( n ) ϕ ( n − τ ( n ) ) −H(n)ϕ ( n − σ ( n ) ) .$
(3.6)

Since $inf n ∈ Z α ( n ) 1 + α ( n ) >0$, it follows from Theorem 6 that the linear system

$Δx(n)=−α(n)x(n+1)$
(3.7)

admits an exponential dichotomy on $Z$. By Theorem 5 and Theorem 6, we deduce that system (3.6) has a bounded solution of the form

$x ϕ ( n ) = ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) [ β ( m ) ϕ ( m − τ ( m ) ) e − γ ( m ) ϕ ( m − τ ( m ) ) − H ( m ) ϕ ( m − σ ( m ) ) ] .$
(3.8)

In virtue of Theorem 2, Theorem 3, Theorem 4, and using the almost periodicity of $∏ r = m n − 1 ( 1 1 + α ( r ) )$ and the fact that the uniform limit of almost periodic sequences is also almost periodic, we deduce that $x ϕ$ is also almost periodic.

Define a mapping $T:B→B$ by setting

$T ( ϕ ( n ) ) = x ϕ (n),∀ϕ∈B.$

It is easy to see that $B ∗$ is a closed subset of $B$. For any $ϕ∈ B ∗$, we have

$x ϕ ( n ) ≤ ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) β ( m ) ϕ ( m − τ ( m ) ) e − γ ( m ) ϕ ( m − τ ( m ) ) = ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) β ( m ) γ ( m ) γ ( m ) ϕ ( m − τ ( m ) ) e − γ ( m ) ϕ ( m − τ ( m ) ) .$

By the fact that $sup u ≥ 0 u e − u = 1 e$, we obtain

$x ϕ (n)≤ ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) β ( m ) γ ( m ) e$
(3.9)

or

$x ϕ (n)≤ ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α − ) ( β γ ) + 1 e .$
(3.10)

Using that $∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α − )= 1 α −$, we end up with

$x ϕ (n)≤ ( β γ ) + 1 α − e ≤ Γ 1 ,∀n∈Z.$
(3.11)

On the other hand, we have

$x ϕ ( n ) = ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) [ β ( m ) ϕ ( m − τ ( m ) ) e − γ ( m ) ϕ ( m − τ ( m ) ) − H ( m ) ϕ ( m − σ ( m ) ) ] ≥ ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) [ β ( m ) γ + γ + ϕ ( m − τ ( m ) ) e − γ + ϕ ( m − τ ( m ) ) − H + Γ 1 ] .$

By virtue of the fact that $min 1 ≤ u ≤ κ u e − u =κ e − κ$, we obtain

$x ϕ (n)≥ β − α + Γ 1 e − γ + Γ 1 − H + Γ 1 α + ≥ Γ 2 ,∀n∈Z.$

This tells that the mapping T is a self-mapping from $B ∗$ to $B ∗$.

Let $φ,ψ∈ B ∗$. Then

$∥ T ( φ ) − T ( ψ ) ∥ B = sup n ∈ Z | T ( φ ( n ) ) − T ( ψ ( n ) ) | = sup n ∈ Z | ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) β ( m ) [ φ ( m − τ ( m ) ) e − γ ( m ) φ ( m − τ ( m ) ) − ψ ( m − τ ( m ) ) e − γ ( m ) ψ ( m − τ ( m ) ) ] − H ( m ) [ φ ( m − σ ( m ) ) − ψ ( m − σ ( m ) ) ] | = sup n ∈ Z | ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α ( r ) ) β ( m ) γ ( m ) [ γ ( m ) φ ( m − τ ( m ) ) e − γ ( m ) φ ( m − τ ( m ) ) − γ ( m ) ψ ( m − τ ( m ) ) e − γ ( m ) ψ ( m − τ ( m ) ) ] − H ( m ) [ φ ( m − σ ( m ) ) − ψ ( m − σ ( m ) ) ] | .$

In virtue of the fact that $sup u ≥ 1 | 1 − u e u |= 1 e 2$, we observe that

$| x e − x − y e − y | = | 1 − ( x + θ ( y − x ) ) e x + θ ( y − x ) | | x − y | ≤ 1 e 2 | x − y | , x , y ∈ [ 1 , ∞ ) , 0 < θ < 1 .$
(3.12)

By A.1, we get

$γ(m)φ ( m − τ ( m ) ) ≥γ(m) Γ 2 ≥γ(m) 1 γ − ≥1,∀n∈Z.$

Therefore, by (1.3), (2.1) and (3.12), we have

$∥ T ( φ ) − T ( ψ ) ∥ B ≤ sup n ∈ Z ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α − ) [ β ( m ) e 2 | φ ( m − τ ( m ) ) − ψ ( m − τ ( m ) ) | + H ( m ) | φ ( m − σ ( m ) ) − ψ ( m − σ ( m ) ) | ] ≤ ( sup n ∈ Z ∑ m = − ∞ n − 1 ∏ r = m n − 1 ( 1 1 + α − ) ) ( β ( m ) e 2 + H + ) ∥ φ − ψ ∥ .$

Therefore, we end up with

$∥ T ( φ ) − T ( ψ ) ∥ B ≤ ( β + α − e 2 + H + α − ) ∥φ−ψ∥,$

which implies by A.2 that the mapping T is contractive on $B ∗$. Therefore, the mapping T possesses a unique fixed point $φ ∗ ∈ B ∗$ such that $T φ ∗ = φ ∗$. Thus, $φ ∗$ is an almost periodic solution of (1.3) in the $B ∗$. The proof is complete. □

We assume that

A.3 $α − >1+ β + e 2 + H +$.

Theorem 8 Let A.1 and A.3 hold. Further, assume $x ∗ (n)$ is a positive almost periodic solution of (1.3) in the set $B ∗$. Then, the solution $x(n, n 0 ,φ)$ of (1.3) with $φ∈ C 0$ converges exponentially to $x ∗ (n)$ as $n→∞$.

Proof Set $x(n)=x(n, n 0 ,φ)$ and $y(n)=x(n)− x ∗ (n)$, where $n∈[ n 0 −r,∞)$. Then

$Δ y ( n ) = − α ( n ) y ( n + 1 ) + β ( n ) [ x ( n − τ ( n ) ) e − γ ( n ) x ( n − τ ( n ) ) − x ∗ ( n − τ ( n ) ) e − γ ( n ) x ∗ ( n − τ ( n ) ) ] − H ( n ) y ( n − σ ( n ) ) .$
(3.13)

The result of Lemma 1 tells that $x(n)$ is positive and bounded on $[ n 0 ,∞)$ and

$Γ 2
(3.14)

Define a function $Φ(u)$ by setting

$Φ(u)= e u − α − + β + 1 e 2 e u ( r + 1 ) + H + e u ( r + 1 ) ,u∈[0,1].$
(3.15)

It is clear that Φ is continuous on $[0,1]$. Then, by A.3 we have

$Φ(0)=1− α − + β + e 2 + H + <0,$

which implies that there exist two constants $η>0$ and $0<λ≤1$ such that

$Φ(λ)= e λ − α − + β + 1 e 2 e λ ( r + 1 ) + H + e λ ( r + 1 ) <−η<0.$
(3.16)

We consider the discrete Lyapunov functional

$V(n)=|y(n)| e λ n .$
(3.17)

Calculating the difference of $V(n)$ along the solution $y(n)$ of (3.13), we have

$Δ V ( n ) = Δ ( | y ( n ) | e λ n ) = Δ | y ( n ) | e λ ( n + 1 ) + | y ( n ) | Δ e λ n ≤ − α ( n ) | y ( n + 1 ) | e λ ( n + 1 ) + β ( n ) | x ( n − τ ( n ) ) e − γ ( n ) x ( n − τ ( n ) ) − x ∗ ( n − τ ( n ) ) e − γ ( n ) x ∗ ( n − τ ( n ) ) | e λ ( n + 1 ) + H ( n ) | y ( n − σ ( n ) ) | e λ ( n + 1 ) + | y ( n ) | ( e λ ( n + 1 ) − e λ n ) ≤ | y ( n ) | e λ ( n + 1 ) − α ( n ) | y ( n + 1 ) | e λ ( n + 1 ) + [ β ( n ) | x ( n − τ ( n ) ) e − γ ( n ) x ( n − τ ( n ) ) − x ∗ ( n − τ ( n ) ) e − γ ( n ) x ∗ ( n − τ ( n ) ) | + H ( n ) | y ( n − σ ( n ) ) | ] e λ ( n + 1 )$
(3.18)

for all $n≥ n 0$.

Let

$M:= e λ n 0 ( max n ∈ [ n 0 , ∞ ) | φ ( n ) − x ∗ ( n ) | + 1 ) ,∀n≥ n 0 .$

Then, we claim that

$V(n)=|y(n)| e λ n
(3.19)

Assume, on the contrary, that there exists $n ∗ > n 0$ such that

$V( n ∗ )≥MandV(n)
(3.20)

which implies that

$V( n ∗ )−M≥0andV(n)−M<0,∀n∈[ n 0 −r, n ∗ ).$
(3.21)

In virtue of (3.12), (3.18) and (3.20), we obtain

$0 ≤ Δ ( V ( n ∗ ) − M ) = Δ V ( n ∗ ) ≤ | y ( n ∗ ) | e λ ( n ∗ + 1 ) − α ( n ∗ ) | y ( n ∗ + 1 ) | e λ ( n ∗ + 1 ) + [ β ( n ∗ ) | x ( n ∗ − τ ( n ∗ ) ) e − γ ( n ∗ ) x ( n ∗ − τ ( n ∗ ) ) − x ∗ ( n ∗ − τ ( n 1 ) ) e − γ ( n ∗ ) x ∗ ( n ∗ − τ ( n ∗ ) ) | + H ( n ∗ ) | y ( n ∗ − σ ( n ∗ ) ) | ] e λ ( n ∗ + 1 ) ≤ | y ( n ∗ ) | e λ ( n ∗ + 1 ) − α ( n ∗ ) | y ( n ∗ + 1 ) | e λ ( n ∗ + 1 ) + β ( n ∗ ) e 2 | y ( n ∗ − τ ( n ∗ ) ) | e λ ( n ∗ + 1 − τ ( n ∗ ) ) e λ τ ( n ∗ ) + H ( n ∗ ) | y ( n ∗ − σ ( n ∗ ) ) | e λ ( n ∗ + 1 − σ ( n ∗ ) ) e λ σ ( n ∗ ) ≤ ( e λ − α − ) M + β + e 2 M e λ ( r + 1 ) + H + M e λ ( r + 1 ) = [ e λ − α − + β + e 2 e λ ( r + 1 ) + H + e λ ( r + 1 ) ] M .$

Thus,

$e λ − α − + β + e 2 e λ ( r + 1 ) + H + e λ ( r + 1 ) ≥0,$

which contradicts (3.16). Hence (3.19) holds. It follows that $|y(n)| for all $n≥ n 0$. The proof is complete. □

## 4 An example and concluding remark

In this section, we construct an example to demonstrate the results obtained in the previous sections. A concluding remark is also reported.

Example 1 Consider the following Nicholson’s blowflies model with a linear harvesting term of the form

$Δ x ( n ) = − ( 18 + cos 2 n ) x ( n + 1 ) + e e − 1 ( 20 + 0.01 | sin 5 n | ) x ( n − e 2 | cos 3 n | ) e − x ( n − e 2 | cos 3 n | ) − ( 18 + sin 2 n ) | sin n | 10 , 000 x ( n − e 2 | cos 5 n | ) ,$
(4.1)

where

$α ( n ) = 18 + cos 2 n , β ( n ) = e e − 1 ( 20 + 0.01 | sin 5 n | ) , τ ( n ) = e 2 | cos 3 n | , γ ( n ) = 1$

and

$σ(n)= e 2 | cos 5 n | ,H(n)= ( 18 + sin 2 n ) | sin n | 10 , 000 .$

It is clear that

$α − =18, α + =19, β − =20 e e − 1 , β + =20.01 e e − 1 , γ + = γ − =1$

and

$τ + = σ + = e 2 , H − =0, H + = 19 10 , 000 .$

Thus, conditions (2.1) and (2.2) hold. Let $Γ 1 =e$ and $Γ 2 =1$. Then

$Γ 1 =e> Γ 2 =1, ( β γ ) + 1 α − e ≈1.1401$

and this shows that condition A.1 is satisfied. It remains to check conditions A.2 and A.3. However, one can see the validity of these conditions since

$β + α − 1 e 2 + H + α − ≈0.83<1and1+ β + e 2 + H + ≈16<18.$

Therefore, we conclude that all assumptions of Theorem 7 and Theorem 8 are fulfilled. Hence, system (4.1) has a positive almost periodic solution $x ∗$ in $B ∗ ={φ:φ∈B,1<φ(n). Moreover, if $φ∈ C 0$, then $x(n, n 0 ,φ)$ converges exponentially to $x ∗$ as $n→∞$.

Remark 1 It is well known that the optimal management of renewable resources has direct relationship to the sustainable development of exploitation of population. One way to handle this is to study population models involving harvesting, dispersal or competition. Assuming that harvesting is a function of the delayed estimate of the true population, Nicholson’s blowflies model involving a linear harvesting term has been the object of recent research.

Following this trend, we study the almost periodic behavior of a discrete analogue of Nicholson’s blowflies model involving a linear harvesting term of form (1.3). It is worth mentioning here that most of the discrete analogues of Nicholson’s models investigated in the literature have involved a linear part of form $Δx(n)=−α(n)x(n)$. In this paper, however, we consider Nicholson’s model of form (1.3) to guarantee the convergence of the series appears in the solution representation (3.8).

A result concerning the persistence of the solutions is provided prior to proving the main theorems. Under the assumptions A.1-A.3, sufficient conditions are established for the existence and exponential convergence of positive almost periodic solutions of (1.3). Our approach is based on the contraction mapping principle as well as on the construction of an appropriate Lyapunov functional.

The results of this paper could be generalized to Nicholson’s model involving multiple delays and multiple linear harvesting terms. As Nicholson’s model under consideration is involving a linear harvesting term, one can easily figure out that some of the results reported in the literature might be no longer applicable for proving the existence and exponential convergence of almost periodic solutions of (1.3). This implies that the main theorems of this paper improve and extend some of previously obtained results.

## References

1. 1.

Gurney WS, Blythe SP, Nisbet RM: Nicholson’s blowflies (revisited). Nature 1980, 287: 17–21. 10.1038/287017a0

2. 2.

Nicholson AJ: An outline of the dynamics of animal populations. Aust. J. Zool. 1954, 2: 9–25. 10.1071/ZO9540009

3. 3.

Kocic VL, Ladas G: Oscillation and global attractivity in the discrete model of Nicholson’s blowflies. Appl. Anal. 1990, 38: 21–31. 10.1080/00036819008839952

4. 4.

Kulenovic MRS, Ladas G, Sficas YS: Global attractivity in Nicholson’s blowflies. Comput. Math. Appl. 1989, 18: 925–928. 10.1016/0898-1221(89)90010-2

5. 5.

Li J, Du C: Existence of positive periodic solutions for a generalized Nicholson’s blowflies model. J. Comput. Appl. Math. 2008, 221(1):226–233. 10.1016/j.cam.2007.10.049

6. 6.

Li W, Fan Y: Existence and global attractivity of positive periodic solutions for the impulsive delay Nicholson’s blowflies model. J. Comput. Appl. Math. 2007, 201(1):55–68. 10.1016/j.cam.2006.02.001

7. 7.

Wei J, Li MY: Hopf bifurcation analysis in a delayed Nicholson blowflies equation. Nonlinear Anal. 2005, 60(7):1351–1367. 10.1016/j.na.2003.04.002

8. 8.

Saker SH, Agarwal S: Oscillation and global attractivity in a periodic Nicholson’s blowflies model. Math. Comput. Model. 2002, 35: 719–731. 10.1016/S0895-7177(02)00043-2

9. 9.

Zhang BG, Xu HX: A note on the global attractivity of a discrete model of Nicholson’s blowflies. Discrete Dyn. Nat. Soc. 1999, 3: 51–55. 10.1155/S1026022699000072

10. 10.

So JWH, Yu JS: On the stability and uniform persistence of a discrete model of Nicholson’s blowflies. J. Math. Anal. Appl. 1995, 193(1):233–244. 10.1006/jmaa.1995.1231

11. 11.

So JWH, Yang Y: Dirichlet problem for the diffusive Nicholson’s blowflies equation. J. Differ. Equ. 1998, 150(2):317–348. 10.1006/jdeq.1998.3489

12. 12.

Thomas DM, Robbins F: Analysis of a nonautonomous Nicholson blowfly model. Physica A 1999, 273(1–2):198–211. 10.1016/S0378-4371(99)00355-6

13. 13.

So JWH, Wu J, Yang Y: Numerical steady state and Hopf bifurcation analysis on the diffusive Nicholson’s blowflies equation. Appl. Math. Comput. 2000, 111(1):53–69. 10.1016/S0096-3003(99)00047-8

14. 14.

Saker SH: Oscillation of continuous and discrete diffusive delay Nicholson’s blowflies models. Appl. Math. Comput. 2005, 167(1):179–197. 10.1016/j.amc.2004.06.083

15. 15.

Saker SH, Zhang BG: Oscillation in a discrete partial delay Nicholson’s blowflies model. Math. Comput. Model. 2002, 36(9–10):1021–1026. 10.1016/S0895-7177(02)00255-8

16. 16.

Saker SH: Oscillation of continuous and discrete diffusive delay Nicholson’s blowflies models. Appl. Math. Comput. 2005, 167(1):179–197. 10.1016/j.amc.2004.06.083

17. 17.

Yi T, Zou X: Global attractivity of the diffusive Nicholson blowflies equation with Neumann boundary condition: a non-monotone case. J. Differ. Equ. 2008, 245(11):3376–3388. 10.1016/j.jde.2008.03.007

18. 18.

Alzabut JO: Almost periodic solutions for impulsive delay Nicholson’s blowflies population model. J. Comput. Appl. Math. 2010, 234: 233–239. 10.1016/j.cam.2009.12.019

19. 19.

Song XY, Chen LS: Optimal harvesting and stability for a predator-prey system with stage structure. Acta Math. Appl., Engl. Ser. 2002, 18(3):423–430. 10.1007/s102550200042

20. 20.

Berezansky L, Braverman E, Idels L: Delay differential logistic equations with harvesting. Math. Comput. Model. 2004, 40: 1509–1525. 10.1016/j.mcm.2005.01.008

21. 21.

Berezansky L, Braverman E, Idels L: Nicholson’s blowflies differential equations revisited: main results and open problems. Appl. Math. Model. 2010, 34: 1405–1417. 10.1016/j.apm.2009.08.027

22. 22.

Long F: Positive almost periodic solution for a class of Nicholson’s blowflies model with a linear harvesting term. Nonlinear Anal. 2012, 13(2):686–693. 10.1016/j.nonrwa.2011.08.009

23. 23.

Long F, Yang M: Positive periodic solutions of delayed Nicholson’s blowflies model with a linear harvesting term. Electron. J. Qual. Theory Differ. Equ. 2011., 2011: Article ID 41

24. 24.

Zhao W, Zhu C, Zhu H: On positive solution for the delay Nicholson’s blowflies model with a harvesting term. Appl. Math. Model. 2012, 36(7):3335–3340. 10.1016/j.apm.2011.10.011

25. 25.

Liu X, Meng J: The positive almost periodic solution for Nicholson-type delay systems with linear harvesting terms. Appl. Math. Model. 2012, 36(7):3289–3298. 10.1016/j.apm.2011.09.087

26. 26.

Li Y, Wang C: Almost functions on time scale and applications. Discrete Dyn. Nat. Soc. 2011., 2011: Article ID 727068

27. 27.

Goh B-S: Management and Analysis of Biological Populations. Elsevier, Amsterdam; 1980.

28. 28.

Wang WD, Chen LS: A predator-prey system with stage structure for predator. Comput. Math. Appl. 1997, 33(8):83–91. 10.1016/S0898-1221(97)00056-4

## Acknowledgements

The authors would like to express their sincere thanks to the editor Prof. Dr. Elena Braverman for handling our paper during the reviewing process and to the referees for suggesting some corrections that help making the content of the paper more accurate.

## Author information

Authors

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

The authors have contributed equally to each part of this paper. All authors read and approved the final version of the manuscript.

## Rights and permissions

Reprints and Permissions

Alzabut, J., Bolat, Y. & Abdeljawad, T. Almost periodic dynamics of a discrete Nicholson’s blowflies model involving a linear harvesting term. Adv Differ Equ 2012, 158 (2012). https://doi.org/10.1186/1687-1847-2012-158 