Related papers: Character Sums Over The Prime Numbers

We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Multiple q-zeta values are a 1-parameter generalization (in fact, a q-analog) of the multiple harmonic sums commonly referred to as multiple zeta values. These latter are obtained from the multiple q-zeta values in the limit as q tends to…

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

In this paper, we will give some estimation for the average error of the prime number theorem.

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

We obtain formulas for the coefficients of positive and negative powers of a partial theta function.

Let $\gamma$ denote imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Certain sums over the $\gamma$'s are evaluated, by using the function $G(s) = \sum_{\gamma>0}\gamma^{-s}$ and other techniques. Some integrals…

Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…

We consider the size of large character sums, proving new lower bounds for the quantity $\Delta(N,q) = \sup_{\chi\neq \chi_0 mod q} |\sum_{n < N} \chi(n)|$ for almost all ranges of $N$. The results are proven using the resonance method and…

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.

In this paper, we consider sums of four generalized polygonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restriction on m modulo 30, we show that for n sufficiently large, it can…

We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…