The main purpose of this paper is to use the elementary and analytic methods, the properties of Gauss sums, and character sums to study the computational problem of a certain hybrid power mean involving the Dedekind sums and a character sum analogous to Kloosterman sum and give two interesting identities for them.
UDC 511
We give a new reciprocity theorem for the Hardy sum Also, a hybrid mean value problem involving the Hardy sum and Kloosterman sum is studied and two exact computational formulae are obtained.
Abstract
We give a corrigendum to the previous paper [ 8] and recover the same quantitative statement: the Kloosterman sum changes sign infinitely often as the modulus runs over squarefree numbers with at most seven prime factors.