Complete Solving for Explicit Evaluation of Gauss Sums in the Index 2 Case
Abstract
Let p be a prime number, q=pf for some positive integer f, N be a positive integer such that (N,p)=1, and let be a primitive multiplicative character of order N over finite field . This paper studies the problem of explicit evaluation of Gauss sums in "index 2 case" (i.e. f=(N)2=[:], where () is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums G() (1-1) in index 2 case with order N being general even integer (i.e. N=2r N0 where r,N0 are positive integers and N03 is odd.) is obtained. Thus, the problem of explicit evaluation of Gauss sums in index 2 case is completely solved.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.