Dynamic analysis of a bacterial resistance model with impulsive state feedback control

Xiaoxiao Yan; Zhong Zhao; Yuanxian Hui; Jingen Yang; Xiaoxiao Yan; Zhong Zhao; Yuanxian Hui; Jingen Yang

doi:10.3934/mbe.2023903

Mathematical Biosciences and Engineering

2023, Volume 20, Issue 12: 20422-20436. doi: 10.3934/mbe.2023903

Previous Article Next Article

Research article

Dynamic analysis of a bacterial resistance model with impulsive state feedback control

1.
School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, China
2.
School of Mathematics and Statistics, Huanghuai University, Zhumadian, Henan 463000, China

Academic Editor: Yang Kuang

Received: 03 September 2023 Revised: 02 October 2023 Accepted: 19 October 2023 Published: 10 November 2023

Bacterial resistance caused by prolonged administration of the same antibiotics exacerbates the threat of bacterial infection to human health. It is essential to optimize antibiotic treatment measures. In this paper, we formulate a simplified model of conversion between sensitive and resistant bacteria. Subsequently, impulsive state feedback control is introduced to reduce bacterial resistance to a low level. The global asymptotic stability of the positive equilibrium and the orbital stability of the order-1 periodic solution are proved by the Poincaré-Bendixson Theorem and the theory of the semi-continuous dynamical system, respectively. Finally, numerical simulations are performed to validate the accuracy of the theoretical findings.

Keywords:

Citation: Xiaoxiao Yan, Zhong Zhao, Yuanxian Hui, Jingen Yang. Dynamic analysis of a bacterial resistance model with impulsive state feedback control[J]. Mathematical Biosciences and Engineering, 2023, 20(12): 20422-20436. doi: 10.3934/mbe.2023903

Related Papers:

[1]	Ridha Dida, Hamid Boulares, Bahaaeldin Abdalla, Manar A. Alqudah, Thabet Abdeljawad . On positive solutions of fractional pantograph equations within function-dependent kernel Caputo derivatives. AIMS Mathematics, 2023, 8(10): 23032-23045. doi: 10.3934/math.20231172
[2]	Saeed M. Ali, Mohammed S. Abdo, Bhausaheb Sontakke, Kamal Shah, Thabet Abdeljawad . New results on a coupled system for second-order pantograph equations with $\mathcal{ABC}$ fractional derivatives. AIMS Mathematics, 2022, 7(10): 19520-19538. doi: 10.3934/math.20221071
[3]	Abdelkader Moumen, Hamid Boulares, Tariq Alraqad, Hicham Saber, Ekram E. Ali . Newly existence of solutions for pantograph a semipositone in $\Psi$ -Caputo sense. AIMS Mathematics, 2023, 8(6): 12830-12840. doi: 10.3934/math.2023646
[4]	Ayub Samadi, Chaiyod Kamthorncharoen, Sotiris K. Ntouyas, Jessada Tariboon . Mixed Erdélyi-Kober and Caputo fractional differential equations with nonlocal non-separated boundary conditions. AIMS Mathematics, 2024, 9(11): 32904-32920. doi: 10.3934/math.20241574
[5]	Hui Huang, Kaihong Zhao, Xiuduo Liu . On solvability of BVP for a coupled Hadamard fractional systems involving fractional derivative impulses. AIMS Mathematics, 2022, 7(10): 19221-19236. doi: 10.3934/math.20221055
[6]	Cuiying Li, Rui Wu, Ranzhuo Ma . Existence of solutions for Caputo fractional iterative equations under several boundary value conditions. AIMS Mathematics, 2023, 8(1): 317-339. doi: 10.3934/math.2023015
[7]	Mohamed Houas, Kirti Kaushik, Anoop Kumar, Aziz Khan, Thabet Abdeljawad . Existence and stability results of pantograph equation with three sequential fractional derivatives. AIMS Mathematics, 2023, 8(3): 5216-5232. doi: 10.3934/math.2023262
[8]	Ahmed M. A. El-Sayed, Wagdy G. El-Sayed, Kheria M. O. Msaik, Hanaa R. Ebead . Riemann-Liouville fractional-order pantograph differential equation constrained by nonlocal and weighted pantograph integral equations. AIMS Mathematics, 2025, 10(3): 4970-4991. doi: 10.3934/math.2025228
[9]	Isra Al-Shbeil, Abdelkader Benali, Houari Bouzid, Najla Aloraini . Existence of solutions for multi-point nonlinear differential system equations of fractional orders with integral boundary conditions. AIMS Mathematics, 2022, 7(10): 18142-18157. doi: 10.3934/math.2022998
[10]	Yujun Cui, Chunyu Liang, Yumei Zou . Existence and uniqueness of solutions for a class of fractional differential equation with lower-order derivative dependence. AIMS Mathematics, 2025, 10(2): 3797-3818. doi: 10.3934/math.2025176

Abstract

1. Introduction

The key to solving the general quadratic congruence equation is to solve the equation of the form $x^2\equiv a\mod p$ , where $a$ and $p$ are integers, $p > 0$ and $p$ is not divisible by $a$ . For relatively large $p$ , it is impractical to use the Euler criterion to distinguish whether the integer $a$ with $(a, p) = 1$ is quadratic residue of modulo $p$ . In order to study this issue, Legendre has proposed a new tool-Legendre's symbol.

Let $p$ be an odd prime, the quadratic character modulo $p$ is called the Legendre's symbol, which is defined as follows:

$\left(\frac{a}{p}\right)= \begin{cases}1, & \text { if } a \text { is a quadratic residue modulo } p; \\ -1, & \text { if } a \text { is a quadratic non-residue modulo } p ;\\ 0, & \text { if } p \mid a.\end{cases}$

The Legendre's symbol makes it easy for us to calculate the level of quadratic residues. The basic properties of Legendre's symbol can be found in any book on elementary number theory, such as ^[1,2,3].

The properties of Legendre's symbol and quadratic residues play an important role in number theory. Many scholars have studied them and achieved some important results. For examples, see the ^{[4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21]}.

One of the most representative properties of the Legendre's symbol is the quadratic reciprocal law:

Let $p$ and $q$ be two distinct odd primes. Then, (see Theorem 9.8 in ^[1] or Theorems 4–6 in ^[3])

$\left(\frac{p}{q}\right)\cdot\left(\frac{q}{p}\right) = (-1)^{\frac{(p-1)(q-1)}{4}}.$

For any odd prime $p$ with $p\equiv1\; \rm mod\; 4$ there exist two non-zero integers $\alpha\left(p\right)$ and $\beta\left(p\right)$ such that

$\begin{align*} p = \alpha^2\left(p\right)+\beta^2\left(p\right). \end{align*}$

(1)

In fact, the integers $\alpha\left(p\right)$ and $\beta\left(p\right)$ in the (1) can be expressed in terms of Legendre's symbol modulo $p$ (see Theorems 4–11 in ^[3])

$\alpha\left(p\right) = \frac{1}{2}\sum\limits_{a = 1}^{p-1}\left(\frac{a^3+a}{p}\right)\; \; \; \rm and\; \; \; \it \beta\left(\it p\right) = \frac{\rm1}{\rm 2}\sum\limits_{a = \rm1}^{p-\rm1}\left(\frac {\it a^{\rm3}+\it ra}{\it p}\right),$

where $r$ is any integer, and $\left(r, p\right) = 1$ , $\left(\frac{r}{p}\right) = -1$ , $\left(\frac{\ast}{p}\right) = \chi_2$ denote the Legendre's symbol modulo $p$ .

Noting that Legendre's symbol is a special kind of character. For research on character, Han ^[7] studied the sum of a special character $\chi\left(ma+\bar{a}\right)$ , for any integer $m$ with $\left(m, p\right) = 1$ , then

$\left|\sum\limits_{a = 1}^{p-1}\chi\left(ma+\bar{a}\right)\right|^2 = 2p+\left(\frac{m}{p}\right)\sum\limits_{a = 1}^{p-1}\chi(a)\sum\limits_{b = 1}^{p-1}\left(\frac{b(b-1)(a^2b-1)}{p}\right),$

which is a special case of a general polynomial character sums $\sum_{a = N+1}^{N+M}\chi\left(f\left(a\right)\right)$ , where $M$ and $N$ are any positive integers, and $f\left(x\right)$ is a polynomial.

In ^[8], Du and Li introduced a special character sums $C\left(\chi, m, n, c;p\right)$ in the following form:

$C\left(\chi, m, n, c;p\right) = \sum\limits_{a = 0}^{p-1}\sum\limits_{b = 0}^{p-1}\chi\left(a^2+na-b^2-nb+c\right)\cdot e\left(\frac{mb^2-ma^2}{p}\right),$

and studied the asymptotic properties of it. They obtained

$\begin{equation*} \label{test1} \begin{split} \sum\limits_{c = 1}^{p-1}\left|C\left(\chi, m, n, c;p\right)\right|^{2k} = \left\{ \begin{array}{l} &p^{2k+1}+\frac{k^2-3k-2}{2}\cdot p^{2k}+O\left(p^{2k-1}\right), \; \; \; \; \rm if\; \chi\ \rm is\ \rm the\ \rm Legendre\ \rm symbol\ \rm {modulo} \ \it p \rm; \\ &p^{2k+1}+\frac{k^2-3k-2}{2}\cdot p^{2k}+O\left(p^{2k-1/2}\right), \; \; \rm if\; \chi\ \rm is\ \rm a\ \rm complex\ \rm character\ \rm {modulo} \ \it p.\\ \end{array} \right. \end{split} \end{equation*}$

Recently, Yuan and Zhang ^[12] researched the question about the estimation of the mean value of high-powers for a special character sum modulo a prime, let $p$ be an odd prime with $p\equiv1\; \rm mod\; 6$ , then for any integer $k\geq0$ , they have the identity

$S_k\left(p\right) = \frac{1}{3}\cdot\left[d^k+\left(\frac{-d+9b}{2}\right)^k+\left(\frac{-d-9b}{2}\right)^k\right],$

where

$S_k\left(p\right) = \frac{1}{p-1}\sum\limits_{r = 1}^{p-1}A^k\left(r\right),$

$A\left(r\right) = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+r\bar{a}}{p}\right),$

and for any integer $r$ with $(r, p) = 1$ .

More relevant research on special character sums will not be repeated. Inspired by these papers, we have the question: If we replace the special character sums with Legendre's symbol, can we get good results on $p\equiv1\; \rm mod\; 4$ ?

We will convert $\beta\left(p\right)$ to another form based on the properties of complete residues

$\beta\left(p\right) = \frac{1}{2}\sum\limits_{a = 1}^{p-1}\left(\frac{a+n\bar{a}}{p}\right),$

where $\bar{a}$ is the inverse of $a$ modulo $p$ . That is, $\bar{a}$ satisfy the equation $x\cdot a\; \equiv1\mod p$ for any integer $a$ with $(a, p) = 1$ .

For any integer $k\geq0$ , $G\left(n\right)$ and $K_k(p)$ are defined as follows:

$G\left(n\right) = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right)\; \; \; \rm {and} \; \; \; \it K_{\it k}\left(\it p\right) = \frac{\rm 1}{\it p-\rm 1}\sum\limits_{\it n\rm = 1}^{\it p-\rm 1}\it G^{\it k}\left(\it n\right).$

In this paper, we will use the analytic methods and properties of the classical Gauss sums and Dirichlet character sums to study the computational problem of $K_k\left(p\right)$ for any positive integer $k$ , and give a linear recurrence formulas for $K_k\left(p\right)$ . That is, we will prove the following result.

Theorem 1. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ , then we have

$K_k\left(p\right) = \left(4p+2\right)\cdot K_{k-2}\left(p\right)-8\left(2\alpha^2-p\right)\cdot K_{k-3}\left(p\right)+\left(16\alpha^4-16p\alpha^2+4p-1\right)\cdot K_{k-4}\left(p\right),$

for all integer $k\geq4$ with

$K_0\left(p\right) = 1, \; K_1\left(p\right) = 0, \; K_2\left(p\right) = 2p+1, \; K_3\left(p\right) = -3(4\alpha^2-2p),$

where

$\alpha = \alpha\left(p\right) = \sum\limits_{a = 1}^{\frac{p-1}{2}}\left(\frac{a+\bar{a}}{p}\right).$

Applying the properties of the linear recurrence sequence, we may immediately deduce the following corollaries.

Corollary 1. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ . Then we have

$\frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\frac{1}{1+\sum _{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right)} = \frac{16\alpha^2p-28\alpha^2-8p^2+14p} {16\alpha^4-16\alpha^2p+4p-1}.$

Corollary 2. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ . Then we have

$\begin{align*} \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\sum\limits_{m = 0}^{p-1}\left(1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right)\right)\cdot e\left(\frac{nm^2}{p}\right) = -\sqrt{p}. \end{align*}$

Corollary 3. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ . Then we have

$\frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\sum\limits_{m = 0}^{p-1}\left[1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right)\right]^2\cdot e\left(\frac{nm^2}{p}\right) = \left(4\alpha^2-2p\right)\cdot\sqrt{p}.$

Corollary 4. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 8$ . Then we have

$\begin{align*} \sum\limits_{n = 1}^{p-1}\left(1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right)\right)\cdot \sum\limits_{m = 0}^{p-1}e\left(\frac{nm^4}{p}\right) = \sqrt{p}\left(-1+B(1)\right)-p, \end{align*}$

where

$B(1) = \sum\limits_{m = 0}^{p-1}e\left(\frac{m^4}{p}\right).$

If we consider such a sequence $F_k\left(p\right)$ as follows: Let $p$ be a prime with $p\equiv1\; \rm mod\; 8$ , $\chi_4$ be any fourth-order character modulo $p$ . For any integer $k\geq0$ , we define the $F_k\left(p\right)$ as

$F_k\left(p\right) = \sum\limits_{n = 1}^{p-1}\frac{1}{G^{k}(n)},$

we have

$\begin{align*} F_{k}\left(p\right) = &\frac{1}{16\alpha^4-16\alpha^2p+4p-1}F_{k-4}\left(p\right)-\frac{(4p+2)}{16\alpha^4-16\alpha^2p+4p-1}F_{k-2}\left(p\right)\\ &+\frac{4(4\alpha^2-2p)}{16\alpha^4-16\alpha^2p+4p-1}F_{k-1}\left(p\right). \end{align*}$

2. Some lemmas

Lemma 1. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ . Then for any fourth-order character $\chi_4 \; \rm{mod} \; \it p$ , we have the identity

$\tau^2(\chi_4)+\tau^2(\bar{\chi_4}) = 2\sqrt{p}\cdot\alpha,$

where

$\tau(\chi_4) = \sum\limits_{a = 1}^{p-1}\chi_4(a)e\left(\frac{a}{p}\right)$

denotes the classical Gauss sums, $e(y) = e^{2\pi iy}, i^2 = -1$ , and $\alpha$ is the same as in the Theorem 1.

Proof. See Lemma 2.2 in ^[9].

Lemma 2. Let $p$ be an odd prime. Then for any non-principal character $\psi$ modulo $p$ , we have the identity

$\tau(\psi^2) = \frac{\psi^2(2)}{\tau(\chi_2)}\cdot\tau(\psi)\cdot\tau(\psi\chi_2),$

where $\chi_2 = \left(\frac{\ast}{p}\right)$ denotes the Legendre's symbol modulo $p$ .

Proof. See Lemma 2 in ^[12].

Lemma 3. Let $p$ be a prime with $p\equiv 1\; \rm mod\; 4$ , then for any integer $n$ with $\left(n, p\right) = 1$ and fourth-order character $\chi_{4}\; \rm mod \; \it p$ , we have the identity

$\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) = -1-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})).$

Proof. For any integer $a$ with $(a, p) = 1$ , we have the identity

$1+\chi_{4}(a)+\chi_2(a)+\bar{\chi_{4}}(a) = 4,$

if $a$ satisfies $a\equiv b^4\; \rm mod \; \it p$ for some integer $b$ with $(b, p) = 1$ and

$1+\chi_{4}(a)+\chi_2(a)+\bar{\chi_{4}}(a) = 0,$

otherwise. So from these and the properties of Gauss sums we have

$\begin{align*} \mathop\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) = &\sum\limits_{a = 1}^{p-1}\left(\frac{a^2}{p}\right)\left(\frac{a^4+n}{p}\right)\nonumber\\ = &\sum\limits_{a = 1}^{p-1}\chi_2\left(a^4\right)\chi_2\left(a^4+n\right)\nonumber\\ = &\sum\limits_{a = 1}^{p-1}(1+\chi_{4}(a)+\chi_2(a)+\bar{\chi_{4}}(a))\cdot\chi_2(a)\cdot\chi_2(a+n)\nonumber\\ = &\sum\limits_{a = 1}^{p-1}(1+\chi_{4}(na)+\chi_2(na)+\bar{\chi_{4}}(na))\cdot\chi_2(na)\cdot\chi_2(na+n)\nonumber\\ = &\sum\limits_{a = 1}^{p-1}\chi_2(a)\chi_2(a+1)+\sum\limits_{a = 1}^{p-1}\chi_{4}(na)\chi_2(a)\chi_2(a+1) \end{align*}$

(2)

$\begin{align*} &+\sum\limits_{a = 1}^{p-1}\chi_2(na)\chi_2(a)\chi_2(a+1)+\sum\limits_{a = 1}^{p-1}\bar{\chi_{4}}(na)\chi_2(a)\chi_2(a+1)\nonumber\\ = &\sum\limits_{a = 1}^{p-1}\chi_2(1+\bar{a})+\sum\limits_{a = 1}^{p-1}\chi_{4}(na)\chi_2(a)\chi_2(a+1)\nonumber\\ &+\sum\limits_{a = 1}^{p-1}\chi_2(n)\chi_2(a+1)+\sum\limits_{a = 1}^{p-1}\bar{\chi_{4}}(na)\chi_2(a)\chi_2(a+1)\nonumber. \end{align*}$

Noting that for any non-principal character $\chi$ ,

$\sum\limits_{a = 1}^{p-1}\chi(a) = 0$

and

$\sum\limits_{a = 1}^{p-1}\chi(a)\chi(a+1) = \frac{1}{\tau(\bar{\chi})}\sum\limits_{b = 1}^{p-1}\sum\limits_{a = 1}^{p-1}\bar{\chi}(b)\chi(a)e\left(\frac{b(a+1)}{p}\right).$

Then we have

$\sum\limits_{a = 1}^{p-1}\chi_2(1+\bar{a}) = -1, \; \; \; \sum\limits_{a = 1}^{p-1}\chi_2(a+1) = -1,$

$\begin{align*} \sum\limits_{a = 1}^{p-1}\chi_{4}(a)\chi_2(a)\chi_2(a+1)& = \frac{1}{\tau(\chi_2)}\sum\limits_{b = 1}^{p-1}\sum\limits_{a = 1}^{p-1}\chi_2(b)\chi_{4}(a)\chi_2(a)e\left(\frac{b(a+1)}{p}\right)\nonumber\\ & = \frac{1}{\tau(\chi_2)}\sum\limits_{b = 1}^{p-1}\bar{\chi_{4}}(b)e\left(\frac{b}{p}\right)\sum\limits_{a = 1}^{p-1}\chi_{4}(ab)\chi_2(ab)e\left(\frac{ab}{p}\right) \end{align*}$

(3)

$\begin{align*} & = \frac{1}{\tau(\chi_2)}\cdot\tau(\bar{\chi_{4}})\cdot\tau(\chi_{4}\chi_2)\nonumber. \end{align*}$

For any non-principal character $\psi$ , from Lemma 2 we have

$\begin{align*} \tau(\psi^2) = \frac{\psi^2(2)}{\tau(\chi_2)}\cdot\tau(\psi)\cdot\tau(\psi\chi_2). \end{align*}$

(4)

Taking $\psi = \chi_{4}$ , note that

$\tau(\chi_2) = \sqrt{p}, \ \ \tau(\chi_{4})\cdot\tau(\bar{\chi_{4}}) = \chi_{4}(-1)\cdot p,$

from (3) and (4), we have

$\begin{align*} \sum\limits_{a = 1}^{p-1}\chi_{4}(a)\chi_2(a)\chi_2(a+1)& = \frac{\bar{\chi_{4}}^2(2)\cdot\tau(\chi_{4}^2)\cdot\tau(\chi_2)\cdot\tau(\bar{\chi_{4}})}{\tau(\chi_2)\cdot\tau(\chi_{4})}\nonumber\\ & = \frac{\chi_2(2)\cdot\tau(\chi_2)\cdot\tau^2(\bar{\chi_{4}})}{\tau(\chi_{4})\cdot\tau(\bar{\chi_{4}})}\nonumber\\ & = \frac{\chi_2(2)\cdot\sqrt{p}\cdot\tau^2(\bar{\chi_{4}})}{\chi_4(-1)\cdot p} \end{align*}$

(5)

$\begin{align*} & = \frac{\chi_2(2)\cdot\tau^2(\bar{\chi_{4}})}{\chi_4(-1)\cdot\sqrt{p}}.\nonumber \end{align*}$

Similarly, we also have

$\begin{align*} \sum\limits_{a = 1}^{p-1}\bar{\chi_{4}}(a)\chi_2(a)\chi_2(a+1) = \frac{\chi_2(2)\cdot\tau^2(\chi_{4})}{\chi_4(-1)\cdot\sqrt{p}}. \end{align*}$

(6)

Consider the quadratic character modulo $p$ , we have

$\begin{align*} \left(\frac{2}{p}\right) = \chi_2(2) = \begin{cases} \; \; 1, &\rm{ if\; \ p\equiv\pm1\; mod\; 8};\\ -1, &\rm{ if\; \ p\equiv\pm3\; mod\; 8}.\\ \end{cases} \end{align*}$

(7)

And when $p\equiv1\; \rm mod\; 8$ , we have $\chi_{4}(-1) = 1$ ; when $p\equiv5\; \rm mod\; 8$ , we have $\chi_{4}(-1) = -1.$ Combining (2) and (5)–(7) we can deduce that

$\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) = -1-\chi_2(n)+\frac{1}{\sqrt{ p}}\cdot\left(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})\right).$

This prove Lemma 3.

Lemma 4. Let $p$ be an odd prime with $p\equiv1\; \rm mod\; 4$ . Then for any integer $k\geq4$ and $n$ with $(n, p) = 1$ , we have the fourth-order linear recurrence formula

$G^k(n) = (4p+2)\cdot G^{k-2}(n)+8(p-2\alpha^2)\cdot G^{k-3}(n)+[(4\alpha^2-2p)^2-(2p-1)^2]\cdot G^{k-4}(n),$

where

$\alpha = \alpha(p) = \frac{1}{2}\sum\limits_{a = 1}^{p-1}\left(\frac{a^3+a}{p}\right) = \sum\limits_{a = 1}^{\frac{p-1}{2}}\left(\frac{a+\bar{a}}{p}\right),$

$\left(\frac{\ast} {p}\right) = \chi_2$ denotes the Legendre's symbol.

Proof. For $p\equiv1\; \rm mod\; 4$ , any integer $n$ with $\left(n, p\right) = 1$ , and fourth-order character $\chi_{4}$ modulo $p$ , we have the identity

$\chi_{4}^4(n) = \bar{\chi_{4}}^4(n) = \chi_0(n), \ \ \chi_{4}^2(n) = \chi_2(n),$

where $\chi_0$ denotes the principal character modulo $p$ .

According to Lemma 3,

$\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) = -1-\chi_2(n)+\frac{1}{\sqrt{ p}}\cdot\left(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})\right),$

$G(n) = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right).\quad\quad\quad\quad\quad\quad\quad\quad\ \$

We have

$\begin{align*} G(n) = -\chi_2(n)+\frac{1}{\sqrt{p}}\cdot\left(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})\right), \end{align*}$

(8)

$\begin{align*} G^2(n) = &[-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4}))]^2\\ = &1-2\chi_2(n)\cdot\frac{1}{\sqrt{p}}\cdot\left(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})\right)\\ &+\frac{1}{ p}\cdot\left(\chi_2(n)\cdot\tau^4(\bar{\chi_{4}})+\chi_2(n)\cdot\tau^4(\chi_{4})+2p^2\right)\\ = &1-2\chi_2(n)\cdot\frac{1}{\sqrt{p}}\cdot\left(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4})\right)\\ &+\frac{1}{p}\cdot\left(\chi_2(n)\cdot(\tau^4(\bar{\chi_{4}})+\tau^4(\chi_{4}))+2p^2\right). \end{align*}$

According to Lemma 1, we have

$\left(\tau^2(\chi_{4})+\tau^2(\bar{\chi_{4}})\right)^2 = \tau^4(\bar{\chi_{4}})+\tau^4(\chi_{4})+2p^2 = 4p\alpha^2.$

Therefore, we may immediately deduce

$\begin{align*} G^2(n) = &1-2(\chi_2(n)\cdot\left( G(n)+\chi_2(n)\right)\nonumber\\ &+\frac{1}{p}\left(\chi_2(n)\cdot(\tau^4(\bar{\chi_{4}})+\tau^4(\chi_{4}))+2p^2\right)\nonumber\\ = &1-2\chi_2(n)\cdot\left( G(n)+\chi_2(n)\right) \end{align*}$

(9)

$\begin{align*} &+\frac{1}{p}\cdot\left[\chi_2(n)((\tau^2(\bar{\chi_{4}})+\tau^2(\chi_{4}))^2-2p^2)+2p^2\right]\nonumber\\ = &2p-1-2\chi_2(n)\cdot G(n)+\left(4\alpha^2-2p\right)\cdot\chi_2(n)\nonumber, \end{align*}$

$\begin{align*} \; \; \; \; \; \; \; \; \; \; \; \; \; \; G^3(n) = &[-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\cdot\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\cdot\tau^2(\chi_{4}))]^3\nonumber\\ = &\left(2p-1-2\chi_2(n)\cdot G(n)+\left(4\alpha^2-2p\right)\cdot\chi_2(n)\right)\cdot G(n) \end{align*}$

(10)

$\begin{align*} = &(4\alpha^2-2p)\chi_2(n)\cdot G(n)+(2p+3)G(n)-(4p-2)\chi_2(n) -2(4\alpha^2-2p)\nonumber \end{align*}$

and

$\begin{align*} \left[G^2(n)-(2p-1)\right]^2 = \left[\chi_2(n)\cdot(4\alpha^2-2p)-2\chi_2(n)\cdot G(n)\right]^2, \end{align*}$

which implies that

$\begin{align*} G^4(n) = (4p+2)\cdot G^{2}(n)+8(p-2\alpha^2)\cdot G(n)+[(4\alpha^2-2p)^2-(2p-1)^2]. \end{align*}$

(11)

So for any integer $k\geq4$ , from (8)–(11), we have the fourth-order linear recurrence formula

$\begin{align*} G^k(n)& = G^{k-4}(n)\cdot G^4(n)\\ & = (4p+2)\cdot G^{k-2}(n)+8(p-2\alpha^2)\cdot G^{k-3}(n)+[(4\alpha^2-2p)^2-(2p-1)^2]\cdot G^{k-4}(n). \end{align*}$

This proves Lemma 4.

3. Proof of the theorem

In this section, we will complete the proof of our theorem.

Let $p$ be any prime with $p\equiv 1\; \rm mod\; 4$ , then we have

$\begin{align*} K_0(p) = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}G^0(n) = \frac{p-1}{p-1} = 1.\; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \end{align*}$

(12)

$\begin{align*} K_1(p)& = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}G^1(n)\nonumber\\ & = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\left(-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\tau^2(\chi_{4}))\right)\\& = 0, \end{align*}$

(13)

$\begin{align*} \; \; \; \; \; K_2(p)& = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}G^2(n)\nonumber\\ & = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\left(-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\tau^2(\chi_{4}))\right)^2 \\ & = 2p+1,\end{align*}$

(14)

$\begin{align*} \; \; \; \; \; K_3(p)& = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}G^3(n)\nonumber\\ & = \frac{1}{p-1}\sum\limits_{n = 1}^{p-1}\left(-\chi_2(n)+\frac{1}{\sqrt{p}}\cdot(\chi_{4}(n)\tau^2(\bar{\chi_{4}})+\bar{\chi_{4}}(n)\tau^2(\chi_{4}))\right)^3 \\ & = -3(4\alpha^2-2p).\end{align*}$

(15)

It is clear that from Lemma 4, if $k\geq4$ , we have

$\begin{align*} \; \; \; \; \; K_k(p) = &\frac{1}{p-1}\sum\limits_{n = 1}^{p-1}G^k(n)\nonumber\\ = &(4p+2)\cdot K_{k-2}(p)-8\left(2\alpha^2-p\right)\cdot K_{k-3}(p) +(16\alpha^4-16p\alpha^2+4p-1)\cdot K_{k-4}(p). \end{align*}$

(16)

Now Theorem 1 follows (12)–(16). Obviously, using Theorem 1 to all negative integers, and that lead to Corollary 1.

This completes the proofs of our all results.

Some notes:

Note 1: In our theorem, know $n$ is an integer, and $(n, p) = 1$ . According to the properties of quadratic residual, $\chi_2(n) = \pm1$ , $\chi_4(n) = \pm1$ .

Note 2: In our theorem, we only discussed the case $p\equiv1\; \rm mod\; 8$ . If $p\equiv3\; \rm mod\; 4$ , then the result is trivial. In fact, in this case, for any integer $n$ with $(n, p) = 1$ , we have the identity

$\begin{align*} G(n)& = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^4}{p}\right)\cdot\left(\frac{a^4+n}{p}\right)\\ & = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a}{p}\right)\cdot\left(\frac{a+n}{p}\right) = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{a^2+na}{p}\right)\\ & = 1+\sum\limits_{a = 1}^{p-1}\left(\frac{1+n\bar{a}}{p}\right) = \sum\limits_{a = 0}^{p-1}\left(\frac{1+na}{p}\right) = 0. \end{align*}$

Thus, for all prime $p$ with $p\equiv3\; \rm mod\; 4$ and $k\geq1$ , we have $K_k(p) = 0$ .

4. Conclusions

The main result of this paper is Theorem 1. It gives an interesting computational formula for $K_k(p)$ with $p\equiv1\; \rm mod\; 4$ . That is, for any integer $k$ , we have the identity

$K_k(p) = (4p+2)\cdot K_{k-2}(p)-8\left(2\alpha^2-p\right)\cdot K_{k-3}(p)+(16\alpha^4-16p\alpha^2+4p-1)\cdot K_{k-4}(p).$

Thus, the problems of calculating a linear recurrence formula of one kind special character sums modulo a prime are given.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

The authors are grateful to the anonymous referee for very helpful and detailed comments.

This work is supported by the N.S.F. (11971381, 12371007) of China and Shaanxi Fundamental Science Research Project for Mathematics and Physics (22JSY007).

Conflict of interest

The authors declare no conflicts of interest.

References

[1]	K. Ababneh, I. E. Alkhazali, The impact of antibiotic abuse: Health and economic burden, Biomed. J. Sci. Tech. Res., 16 (2019), 11794–11797. https://doi.org/10.26717/BJSTR.2019.16.002802 doi: 10.26717/BJSTR.2019.16.002802
[2]	D. J. Austin, R. M. Anderson, Studies of antibiotic resistance within the patient, hospitals and the community using simple mathematical models, Philos. Trans. R. Soc., B, 354 (1999), 721–738. http://doi.org/10.1098/rstb.1999.0425 doi: 10.1098/rstb.1999.0425
[3]	J. M. A. Blair, M. A. Webber, A. J. Baylay, D. O. Ogbolu, L. J. V. Piddock, Molecular mechanisms of antibiotic resistance, Nat. Rev. Microbiol., 13 (2015), 42–51. https://doi.org/10.1038/nrmicro3380 doi: 10.1038/nrmicro3380
[4]	J. J. Dong, J. D. Russo, K. Sampson, Population dynamics model and analysis for bacteria transformation and conjugation, J. Phys. Commun., 4 (2020), 095021. https://doi.org/10.1088/2399-6528/abb8be doi: 10.1088/2399-6528/abb8be
[5]	T. Stalder, L. M. Rogers, C. Renfrow, H. Yano, Z. Smith, E. M. Top, Emerging patterns of plasmid-host coevolution that stabilize antibiotic resistance, Sci. Rep., 7 (2017), 4853. https://doi.org/10.1038/s41598-017-04662-0 doi: 10.1038/s41598-017-04662-0
[6]	E. Ibargüen-Mondragón, J. P. Romero-Leiton, L. Esteva, M. C. Gómez, S. P. Hidalgo-Bonilla, Stability and periodic solutions for a model of bacterial resistance to antibiotics caused by mutations and plasmids, Appl. Math. Modell., 76 (2019), 238–251. https://doi.org/10.1016/j.apm.2019.06.017 doi: 10.1016/j.apm.2019.06.017
[7]	E. Ibargüen-Mondragón, S. Mosquera, M. Cerón, E. M. Burbano-Rosero, Sandra P. Hidalgo-Bonilla, L. Esteva, et al., Mathematical modeling on bacterial resistance to multiple antibiotics caused by spontaneous mutations, Biosystems, 117 (2014), 60–67. https://doi.org/10.1016/j.biosystems.2014.01.005 doi: 10.1016/j.biosystems.2014.01.005
[8]	B. Daşbaşı, İ. Öztürk, Mathematical modelling of bacterial resistance to multiple antibiotics and immune system response, SpringerPlus, 5 (2016), 1–17. https://doi.org/10.1186/s40064-016-2017-8 doi: 10.1186/s40064-016-2017-8
[9]	X. Hou, B. Liu, L. Wang, Z. Zhao, Complex dynamics in a Filippov pest control model with group defense, Int. J. Biomath., 15 (2022), 2250053. https://doi.org/10.1142/S179352452250053X doi: 10.1142/S179352452250053X
[10]	A. M. Garber, Antibiotic exposure and resistance in mixed bacterial populations, Theor. Popul. Biol., 32 (1987), 326–346. https://doi.org/10.1016/0040-5809(87)90053-0 doi: 10.1016/0040-5809(87)90053-0
[11]	Z. Zhao, F. Tao, Q. Li, Dynamic analysis of conversion from a drug-sensitivity strain to a drug-resistant strain, Int. J. Biomath., 11 (2018), 1850113. https://doi.org/10.1142/S1793524518501139 doi: 10.1142/S1793524518501139
[12]	J. Jia, Y. Zhao, Z. Zhao, B. Liu, X. Song, Y. Hui, Dynamics of a within-host drug resistance model with impulsive state feedback control, Math. Biosci. Eng., 20 (2023), 2219–2231. https://doi.org/10.3934/mbe.2023103 doi: 10.3934/mbe.2023103
[13]	E. Massad, M. N. Burattini, F. A. B. Coutinho, An optimization model for antibiotic use, Appl. Math. Comput., 201 (2008), 161–167. https://doi.org/10.1016/j.amc.2007.12.007 doi: 10.1016/j.amc.2007.12.007
[14]	E. Ibargüen-Mondragón, L. Esteva, M. C. Gómez, An optimal control problem applied to plasmid-mediated antibiotic resistance, J. Appl. Math. Comput., 68 (2022), 1635–1667. https://doi.org/10.1007/s12190-021-01583-0 doi: 10.1007/s12190-021-01583-0
[15]	W. Lv, L. Liu, S. J. Zhuang, Dynamics and optimal control in transmission of tungiasis diseases. Int. J. Biomath., 15 (2022), 2150076. https://doi.org/10.1142/S1793524521500765
[16]	J. Xu, S. Yuan, T. Zhang, Optimal harvesting of a fuzzy water hyacinth-fish model with Kuznets curve effect, Int. J. Biomath., 16 (2023), 2250082. https://doi.org/10.1142/S1793524522500826 doi: 10.1142/S1793524522500826
[17]	M. Bodzioch, P. Bajger, U. Foryś, Competition between populations: preventing domination of resistant population using optimal control, Appl. Math. Modell., 114 (2023), 671–693. https://doi.org/10.1016/j.apm.2022.10.016 doi: 10.1016/j.apm.2022.10.016
[18]	G. Rigatos, M. Abbaszadeh, G. Cuccurullo, A nonlinear optimal control method against the spreading of epidemics, Int. J. Biomath., 15 (2022), 2250026. https://doi.org/10.1142/S1793524522500267 doi: 10.1142/S1793524522500267
[19]	Q. Liu, L. Huang, L. Chen, A pest management model with state feedback control, Adv. Differ. Equations, 2016 (2016), 1–11. https://doi.org/10.1186/s13662-016-0985-1 doi: 10.1186/s13662-016-0985-1
[20]	M. Zhang, G. Song, L. Chen, A state feedback impulse model for computer worm control, Nonlinear Dyn., 85 (2016), 1561–1569. https://doi.org/10.1007/s11071-016-2779-0 doi: 10.1007/s11071-016-2779-0
[21]	B. Liu, Y. Tian, B. Kang, Dynamics on a holling II predator-prey model with state-dependent impulsive control, Int. J. Biomath., 5 (2012), 1260006. https://doi.org/10.1142/S1793524512600066 doi: 10.1142/S1793524512600066
[22]	H. Li, Y. Tian, Dynamic behavior analysis of a feedback control predator-prey model with exponential fear effect and Hassell-Varley functional response, J. Franklin Inst., 360 (2023), 3479–3498. https://doi.org/10.1016/j.jfranklin.2022.11.030 doi: 10.1016/j.jfranklin.2022.11.030
[23]	P. Feketa, V. Klinshov, L. Lücken, A survey on the modeling of hybrid behaviors: How to account for impulsive jumps properly, Commun. Nonlinear Sci. Numer. Simul., 103 (2021), 105955. https://doi.org/10.1016/j.cnsns.2021.105955 doi: 10.1016/j.cnsns.2021.105955
[24]	M. Huang, L. Chen, X. Song, Stability of a convex order one periodic solution of unilateral asymptotic type, Nonlinear Dyn., 90 (2017), 83–93. https://doi.org/10.1007/s11071-017-3647-2 doi: 10.1007/s11071-017-3647-2
[25]	L. Chen, X. Liang, Y. Pei, The periodic solutions of the impulsive state feedback dynamical system, Commun. Math. Biol. Neurosci., 2018 (2018), 14–29. https://doi.org/10.28919/cmbn/3754 doi: 10.28919/cmbn/3754
[26]	Y. Tian, Y. Gao, K. Sun, A fishery predator-prey model with anti-predator behavior and complex dynamics induced by weighted fishing strategies, Math. Biosci. Eng., 20 (2023), 1558–1579. https://doi.org/10.3934/mbe.2023071 doi: 10.3934/mbe.2023071
[27]	S. Dashkovskiy, P. Feketa, Input-to-state stability of impulsive systems and their networks, Nonlinear Anal.: Hybrid Syst., 26 (2017), 190–200. https://doi.org/10.1016/j.nahs.2017.06.004 doi: 10.1016/j.nahs.2017.06.004
[28]	J. P. Hespanha, D. Liberzon, A. R. Teel, Lyapunov conditions for input-to-state stability of impulsive systems, Automatica, 44 (2008), 2735–2744. https://doi.org/10.1016/j.automatica.2008.03.021 doi: 10.1016/j.automatica.2008.03.021
[29]	C. Briat, A. Seuret, Robust stability of impulsive systems: A functional-based approach, IFAC Proc. Vol., 45 (2012), 412–417. https://doi.org/10.3182/20120606-3-NL-3011.00064 doi: 10.3182/20120606-3-NL-3011.00064
[30]	Y. Tian, Y. Gao, K. Sun, Qualitative analysis of exponential power rate fishery model and complex dynamics guided by a discontinuous weighted fishing strategy, Commun. Nonlinear Sci. Numer. Simul., 118 (2023), 107011. https://doi.org/10.1016/j.cnsns.2022.107011 doi: 10.1016/j.cnsns.2022.107011

This article has been cited by:

1.	Mounia Mouy, Hamid Boulares, Saleh Alshammari, Mohammad Alshammari, Yamina Laskri, Wael W. Mohammed, On Averaging Principle for Caputo–Hadamard Fractional Stochastic Differential Pantograph Equation, 2022, 7, 2504-3110, 31, 10.3390/fractalfract7010031
2.	Sabbavarapu Nageswara Rao, Manoj Singh, Ahmed Hussein Msmali, Abdullah Ali H. Ahmadini, Existence of Positive Solutions for a Coupled System of p-Laplacian Semipositone Hadmard Fractional BVP, 2023, 7, 2504-3110, 499, 10.3390/fractalfract7070499

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)