On Kloosterman sums over finite fields of characteristic 3
classification
🧮 math.NT
math.CO
keywords
kloostermansumscharacteristicfieldsfinitealgorithmdividesdivisibility
read the original abstract
We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.