The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On polynomial Gauss sums (mod Pⁿ), n ≥ 2”

On the fourth-order linear recurrence formula related to classical Gauss sums

Chen Zhuoyu, Zhang Wenpeng (2017)

Open Mathematics

Similarity:

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.