Characteristics and subtypes of depressive symptoms in Chinese female breast cancer patients of different ages: a cross-sectional study

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:

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])

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

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])

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

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:

and studied the asymptotic properties of it. They obtained

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

where

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

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:

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

for all integer $k\geq4$ with

where

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

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

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

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

where

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

we have

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

where

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

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

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

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

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

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

and

Then we have

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

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

from (3) and (4), we have

Similarly, we also have

Consider the quadratic character modulo $p$, we have

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

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

where

$\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

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

According to Lemma 3,

We have

According to Lemma 1, we have

Therefore, we may immediately deduce

and

which implies that

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

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

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

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

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

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.