scholarly journals A Certain Mean Square Value Involving Dirichlet L-Functions

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 948
Author(s):  
Wenpeng Zhang ◽  
Di Han
Keyword(s):  
Positive Integer ◽  
Character Sums ◽  
Mean Square ◽  
Trigonometric Sums ◽  
Integer Points ◽  
Computational Problem ◽  
Elementary Methods

The main purpose of this article is using the elementary methods, the properties of Dirichlet L-functions to study the computational problem of a certain mean square value involving Dirichlet L-functions at positive integer points, and give some exact calculating formulae. As some applications, we obtain some interesting identities and inequalities involving character sums and trigonometric sums.

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

2017 ◽  
Vol 15 (1) ◽  
pp. 1251-1255 ◽  
Author(s):  
Chen Zhuoyu ◽  
Zhang Wenpeng
Keyword(s):  
Positive Integer ◽  
Fourth Order ◽  
Recurrence Formula ◽  
Character Sums ◽  
Gauss Sums ◽  
Linear Recurrence ◽  
Analytic Method ◽  
Order Linear ◽  
Computational Problem

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.

scholarly journals A Note on the Primitive Roots and the Golomb Conjecture

2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Yiwei Hou ◽  
Hongyan Wang
Keyword(s):  
Positive Integer ◽  
Character Sums ◽  
Fixed Positive Number ◽  
Elementary Methods ◽  
Primitive Roots

In this paper, we use the elementary methods and the estimates for character sums to prove the following conclusion. Let p be a prime large enough. Then, for any positive integer n with p 1 / 2 + ɛ ≤ n < p , there must exist two primitive roots α and β modulo p with 1 < α , β ≤ n − 1 such that the equation n = α + β holds, where 0 < ɛ < 1 / 2 is a fixed positive number. In other words, n can be expressed as the exact sum of two primitive roots modulo p .

scholarly journals On the High-Power Mean of the Generalized Gauss Sums and Kloosterman Sums

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 907 ◽  
Author(s):  
Xinyu Liu ◽  
Wenpeng Zhang
Keyword(s):  
High Power ◽  
Character Sums ◽  
Gauss Sums ◽  
Kloosterman Sums ◽  
Power Mean ◽  
Trigonometric Sums ◽  
Computational Problem

The main aim of this paper is to use the properties of the trigonometric sums and character sums, and the number of the solutions of several symmetry congruence equations to research the computational problem of a certain sixth power mean of the generalized Gauss sums and generalized Kloosterman sums, and to give two exact computational formulae for them.

scholarly journals The Mean Values of Character Sums and Their Applications

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 318
Author(s):  
Jiafan Zhang ◽  
Yuanyuan Meng
Keyword(s):  
Character Sums ◽  
Gauss Sums ◽  
Mean Values ◽  
Special Polynomials ◽  
Elementary Methods ◽  
The Mean

In this paper, we use the elementary methods and properties of classical Gauss sums to study the calculation problems of some mean values of character sums of special polynomials, and obtained several interesting calculation formulae for them. As an application, we give a criterion for determining that 2 is the cubic residue for any odd prime p.

scholarly journals Some Symmetric Identities Involving Fubini Polynomials and Euler Numbers

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 303 ◽  
Author(s):  
Zhao Jianhong ◽  
Chen Zhuoyu
Keyword(s):  
Calculation Method ◽  
Computational Formula ◽  
Euler Numbers ◽  
Special Sequence ◽  
Computational Problem ◽  
Elementary Methods ◽  
Symmetric Identities ◽  
Recursive Calculation

The aim of this paper is to use elementary methods and the recursive properties of a special sequence to study the computational problem of one kind symmetric sums involving Fubini polynomials and Euler numbers, and give an interesting computational formula for it. At the same time, we also give a recursive calculation method for the general case.

scholarly journals On Classical Gauss Sums and Some of Their Properties

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 625 ◽  
Author(s):  
Li Chen
Keyword(s):  
Recursive Formula ◽  
Character Sums ◽  
Gauss Sums ◽  
Computational Problem ◽  
Rational Polynomials

The goal of this paper is to solve the computational problem of one kind rational polynomials of classical Gauss sums, applying the analytic means and the properties of the character sums. Finally, we will calculate a meaningful recursive formula for it.

scholarly journals The mean values of Dirichlet L-functions at integer points and class numbers of cyclotomic fields

1994 ◽  
Vol 134 ◽  
pp. 151-172 ◽  
Author(s):  
Masanori Katsurada ◽  
Kohji Matsumoto
Keyword(s):  
Positive Integer ◽  
Dirichlet Character ◽  
Class Numbers ◽  
Cyclotomic Fields ◽  
Mean Values ◽  
Integer Points ◽  
Principal Character ◽  
Dirichlet Characters ◽  
The Mean

Let q be a positive integer, and L(s, χ) the Dirichlet L-function corresponding to a Dirichlet character χ mod q. We putwhere χ runs over all Dirichlet characters mod q except for the principal character χ0.

scholarly journals Elementary methods in the theory of numbers

1939 ◽  
Vol 31 ◽  
pp. xvi-xxiii
Author(s):  
S. A. Scott
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Exponential Function ◽  
Monotone Sequence ◽  
Binomial Theorem ◽  
Irrational Numbers ◽  
Early Stages ◽  
Elementary Methods ◽  
Usual Notation ◽  
Theory Of Numbers

§ 1. The importance of proving inequalities of an essentially algebraic nature by “elementary” methods has been emphasised by Hardy (Prolegomena to a Chapter on Inequalities), and by Hardy, Littlewood and Polya (Inequalities). The object of this Note is to show how some of the results in the early stages of Number Theory can be obtained by making a minimum appeal to irrational numbers and the notion of a limit. We use the elementary notion of a logarithm to a base “a” > 1, and make no appeal to the exponential function. The Binomial Theorem is only used for a positive integer index. Our minimum appeal rests in the assumption that a bounded monotone sequence tends to a limit. We adopt throughout the usual notation. Finally, it need scarcely be added that the methods employed are not claimed to be new.

On the general trigonometric sums weighted by character sums

2015 ◽  
Vol 268 ◽  
pp. 375-387
Author(s):  
Qing Tian ◽  
Wei Yang ◽  
Liping Ding
Keyword(s):  
Character Sums ◽  
Trigonometric Sums

scholarly journals The generalized quadratic Gauss sums and its sixth power mean

2021 ◽  
Vol 6 (10) ◽  
pp. 11275-11285
Author(s):  
Xingxing Lv ◽  
◽  
Wenpeng Zhang
Keyword(s):  
Gauss Sums ◽  
Power Mean ◽  
Computational Problem ◽  
Elementary Methods

<abstract><p>In this article, we using elementary methods, the number of the solutions of some congruence equations and the properties of the Legendre's symbol to study the computational problem of the sixth power mean of a certain generalized quadratic Gauss sums, and to give an exact calculating formula for it.</p></abstract>

Sign in / Sign up

Export Citation Format

Share Document