Related papers: On primitive Dirichlet characters and the Riemann …

We, by making use of elementary arguments, deduce integral representations of the Legendre chi function $\chi_{s}(x)$ valid for $|z|<1$ and $\Re(s)>1$. Our earlier established results on the integral representations for the Riemann zeta…

Given a sequence of frequencies $\{\lambda_n\}_{n\geq1}$, a corresponding generalized Dirichlet series is of the form $f(s)=\sum_{n\geq 1}a_ne^{-\lambda_ns}$. We are interested in multiplicatively generated systems, where each number…

Let $\lambda$ be the Liouville function. Assuming the Generalised Riemann Hypothesis for Dirichlet $L$-functions (GRH), we show that for every sufficiently large even integer $N$ there are $a,b \geq 1$ such that $$ a+b = N \text{ and }…

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

The achievement of this paper is a confutation of the inequality addressed by the Nicolas criterion for the Riemann Hypothesis, carried out after establishing properties of two related sequences. One of them is the product…

In this paper, we prove the simultaneous non-vanishing of four Dirichlet $L$-functions at any point on the critical line. More precisely, let $\chi_1,\ldots,\chi_4$ be even Dirichlet characters modulo $D_1,\ldots, D_4$ respectively, where…

We prove a result on the large deviations of the central values of even primitive Dirichlet $L$-functions with a given modulus. For $V\sim \alpha\log\log q$ with $0<\alpha<1$, we show that \begin{equation}\nonumber\frac{1}{\varphi(q)} \#…

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

Let $\lfloor x\rfloor$ denote the integer part of $x$. For every sequence $(C_k)_{k\ge 1}$ of positive integers, we define $\xi(C_k)$ as the smallest real number $\xi>1$ such that $\lfloor \xi^{C_k} \rfloor$ is a prime number for every…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

As well known, the important hypothesis formulated by B.G. RIEMANN in 1859 states that all non-trivial zeroes of the Zeta function $Z(s)=\sum_{n=1}^{\infty } n^{-s}$ should fall on the Critical Line (C.L.) $Re(s)=\frac{1}{2}$.\\ Although…

Let $f(n)$ be a multiplicative function with $|f(n)|\leq 1, q$ be a prime number and $a$ be an integer with $(a, q)=1, \chi$ be a non-principal Dirichlet character modulo $q$. Let $\varepsilon$ be a sufficiently small positive constant, $A$…

Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…

We numerically study the statistical properties of differences of zeros of Riemann zeta function and L-functions predicted by the theory of the e\~ne product. In particular, this provides a simple algorithm that computes any non-real…

A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…

A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a primitive set $A$ is universally bounded over all choices for…

The classical theorem of Schnirelmann states that the primes are an additive basis for the integers. In this paper we consider the analogous multiplicative setting of the cyclic group $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$, and…

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…