On Kloosterman sums over finite fields of characteristic 3
Abstract
We study the divisibility by 3k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.
0
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.