2000 character limit reached
On Kloosterman sums over finite fields of characteristic 3
Published 23 Jan 2016 in math.NT and math.CO | (1601.07039v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.