Affiliation:
1. School of Mathematics, Northwest University, Xi’an, Shaanxi, China
Abstract
Abstract
Let p be an odd prime with p ≡ 1 mod 4, k be any positive integer, ψ be any fourth-order character mod p. In this paper, we use the analytic method and the properties of character sums mod p to study the computational problem of G(k, p) = τk(ψ)+τk(ψ), and give an interesting fourth-order linear recurrence formula for it, where τ(ψ) denotes the classical Gauss sums.
Reference24 articles.
1. Exponential sums modulo prime powers;Acta Arithmetica,2002
2. Using Stepanov’s method for exponential sums involving rational functions;Journal of Number Theory,2006
3. On the fourth power mean of one kind special quadratic Gauss sums;Journal of Northwest University (Natural Science Edition),2016
4. On the quartic Gauss sums and their recurrence property;Advances in Difference Equations,2017
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献