1. Introduction
Let
be an integer. For any Dirichlet character
, according to the definition of classical Gauss sums
, we can write
where
.
Since this sum appears in numerous classical number theory problems, and it has a close connection with the trigonometric sums, we believe that classical Gauss sums play a crucial part in analytic number theory. Because of this phenomenon, plenty of experts have researched Gauss sums. Meanwhile, more conclusions have been obtained as regards their arithmetic properties. Such as the following results provided by Chen and Zhang [
1]:
Let
p be an odd prime with
,
be any fourth-order character
. Then one has the identity
where
denotes the the Legendre’s symbol
(please see Reference [
1,
2] for its definition and related properties), and
.
If
p is a prime with
,
is any third-order character
, then Zhang and Hu [
3] had already obtained an analogous result (see Lemma 1). However, perhaps the most beautiful and important property of Gauss sums
is that
, for any primitive character
.
Reference [
2] and References [
4,
5,
6,
7,
8,
9,
10,
11,
12,
13] have a good deal of various elementary properties of Gauss sums. In this paper, the following rational polynomials of Gauss sums attract our attention.
where
p is an odd prime,
k is a non-negative integer,
is any non-principal character
.
Observing the basic properties of Equation (
1), we noticed that hardly anyone had published research in any academic papers to date. We consider that the question is significant. In addition, the regularity of the value distribution of classical Gauss sums could be better revealed. Presently, we will explain certain properties discovered in our investigation. See that
has some good properties. In fact, for some special character
, the second-order linear recurrence formula for
for all integers
may be found similarly.
The goal of this paper is to use the analytic method and the properties of the character sums to solve the computational problem of , and to calculate two recursive formulae, which are listed hereafter:
Theorem 1. Let p be a prime with , ψ be any third-order character . Then, for any positive integer k, we can deduce the following second-order linear recursive formulaewhere the initial values and , d is uniquely determined by and . So we can deduce the general term
Theorem 2. Let p be a prime with , ψ be any third-order character . Then, for any positive integer k, we will obtain the second-order linear recursive formulaewhere the initial values , and . Similarly, we can also deduce the general term
2. Several Lemmas
We have used five simple and necessary lemmas to prove our theorems. Hereafter, we will apply relevant properties of classical Gauss sums and the third-order character
, all of which can be found in books concerning elementary and analytic number theory, such as in References [
2,
10], so we will not duplicate the related contents.
Lemma 1. If p is any prime with , ψ is any third-order character , then, we have the equationwhere denotes the classical Gauss sums, d is uniquely determined by and . Proof. See References [
3] or [
8]. □
Lemma 2. Let p be a prime with , ψ be any third-order character , denotes the Legendre’s symbol . The following identity holds Proof. Firstly, using the properties of Gauss sums, we get
On the other side, we get the sums
Combining Equations (
2) and (
3), we obtain
Now, Lemma 2 has been proved. □
Lemma 3. Let p be a prime with , χ be any sixth-order character . Then, about classical Gauss sums , the following holds:where , d is uniquely determined by and . Proof. Since
,
is a third-order character
. Any sixth-order character
can be denoted as
or
. Note that
,
and
, from Lemma 2 we deduce
and
Adding Equations (
4) and (
5), and then applying Lemma 1 we have
Note that
is a real character
,
, and
. If
;
,
, if
. From Equation (
6) we may immediately prove the sum
Let
, then
is a sixth-order character
and
. From Equation (
7) we can deduce the sum term
The proof of Lemma 3 has been completed. □
Lemma 4. Let p be a prime with , ψ be any three-order character . Then, we compute the sum term Proof. Let
be a three-order character
. Then, for any six-order character
, we must have
or
. Without loss of generality we suppose that
, then note that
,
and Theorem 7.5.4 in Reference [
10], we acquire
Using the properties of Gauss sums we can write
Noting that
, we can deduce
Obviously,
and
, applying Equations (
8) and (
9) we have
Combining Equation (
10), Equation (
11) and Lemma 3 we compute
This completes the proof of Lemma 4. □
Lemma 5. Let p be a prime with , ψ be any three-order character . Then, we obtain the sum term Proof. From Lemma 3 and the method of proving Lemma 4 we can easily deduce Lemma 5. □
3. Proofs of the Theorems
In this section, we prove our two theorems. For Theorem 1, since
,
is a third-order character
, then for any positive integer
k, let
Combining Equations (
12) and (
13) we may immediately compute the second-order linear recursive formula
with initial values
and
.
Note that the two roots of the equation
are
So from Equation (
14) and its initial values we may immediately deduce the general term
where
. Now Theorem 1 has been finished.
Similarly, from Lemma 4 and the method of proving Theorem 1 we can easily obtain Theorem 2. Now, we have completed all the proofs of our Theorems.
4. Conclusions
The main results of this paper are Theorem 1 and 2. They give a new second-order linear recurrence formula for Equation (
1) with the third-order character
. Therefore, we can calculate the exact value of Equation (
1). Note that
, so
is a unit root, thus, the results in this paper profoundly reveal the distributional properties of two different Gauss sums quotients on the unit circle.
For the other characters, for example, the fifth-order character with , we naturally ask whether there exists a similar formula as presented in our theorems. This is still an open problem. It will be the content of our future investigations.