The Legendre’s Symbol Modulo p and Its Some Elementary Results

The main purpose of this article is using the elementary methods and the properties of the character sums to study the calculating problem of the number of the solutions for one kind congruence equation modulo p (an odd prime) and give some interesting identities and asymptotic formulas for it.

The congruence equation a¯ + b¯ ≡c¯(modp)

In this paper, we consider the congruence equation [Formula: see text] with [Formula: see text] where [Formula: see text] denotes the multiplicative inverse of [Formula: see text]. We prove that its number of solutions is asymptotic to [Formula: see text] when [Formula: see text] by estimating a certain average of Kloosterman sums via Gauss sums. On the other hand, when [Formula: see text], the number of solutions has order of magnitude at least [Formula: see text]. It would be interesting to better understand its transition of behavior. By transforming the question slightly, one can relate the problem to a certain first moment of Dirichlet [Formula: see text]-functions at [Formula: see text].

On the recursive properties of one kind hybrid power mean involving two-term exponential sums and Gauss sums

The main purpose of this paper is to study the computational problem of one kind hybrid power mean involving two-term exponential sums and quartic Gauss sums using the analytic method and the properties of the classical Gauss sums, and to prove some interesting fourth-order linear recurrence formulae for this problem. As an application of our result, we can also obtain an exact computational formula for one kind congruence equation modp, an odd prime.

One kind power mean of the hybrid Gauss sums

In this paper, we use the analysis method and the properties of trigonometric sums to study the computational problem of one kind power mean of the hybrid Gauss sums. After establishing some relevant lemmas, we give an exact computational formula for it. As an application of our result, we give an exact formula for the number of solutions of one kind diagonal congruence equation modp, wherepbe an odd prime.

On the Golomb’s conjecture and Lehmer’s numbers

Let p be an odd prime. For each integer a with 1 ≤ a ≤ p − 1, it is clear that there exists one and only one ā with 1 ≤ ā ≤ p − 1 such that a · ā ≡ 1 mod p. Let N(p) denote the set of all primitive roots a mod p with 1 ≤ a ≤ p − 1 in which a and ā are of opposite parity. The main purpose of this paper is using the analytic method and the estimate for the hybrid exponential sums to study the solvability of the congruence a + b ≡ 1 mod p with a, b ∈ N(p), and give a sharper asymptotic formula for the number of the solutions of the congruence equation.