Complete solving of explicit evaluation of Gauss sums in the index 2 case

Publication date 25 February 2011

Abstract: Let

p

be a prime number,

q = p^{f}

for some positive integer

f

,

N

be a positive integer such that

g c d (N, p) = 1

, and let

k

be a primitive multiplicative character of order

N

over finite field

f q

. This paper studies the problem of explicit evaluation of Gauss sums in " extsl{index 2 case}" (i.e.

f = f p (N) 2 = [z n : p p]

, where

p (c d)

is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums

G (k^{l} a) (1 l a N - 1)

in index 2 case with order

N

being general even integer (i.e.

N = 2^{r} c d N_{0}

where

r, N_{0}

are positive integers and

N_{0} 3

is odd.) is obtained. Thus, the problem of explicit evaluation of Gauss sums in index 2 case is completely solved.

Recommendations

Cites work

Cited in

(41)

This page was built for publication: Complete solving of explicit evaluation of Gauss sums in the index 2 case