
Abstract In this paper, we use the analysis method and the properties of trigonometric sums to study the computational problem of one kind power mean of the hybrid Gauss sums. After establishing some relevant lemmas, we give an exact computational formula for it. As an application of our result, we give an exact formula for the number of solutions of one kind diagonal congruence equation mod p, where p be an odd prime.
11l05, power mean, Gauss sums, gauss sums, QA1-939, computational formula, Trigonometric and exponential sums (general theory), Gauss and Kloosterman sums; generalizations, 11l03, Mathematics, analysis method
11l05, power mean, Gauss sums, gauss sums, QA1-939, computational formula, Trigonometric and exponential sums (general theory), Gauss and Kloosterman sums; generalizations, 11l03, Mathematics, analysis method
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
