Related papers: Explicit formulae for averages of Goldbach represe…

Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of $(\Delta,x_0)$ such that for all $x \geq x_0$ there exists at least one prime in the interval $(x(1 - \Delta^{-1}), x]$.

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

We prove upper bounds for the mean square of the remainder in the prime geodesic theorem, for every cofinite Fuchsian group, which improve on average on the best known pointwise bounds. The proof relies on the Selberg trace formula. For the…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

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…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

We answer the question positively. In fact, we believe to have proved that every even integer $2N\geq3\times10^{6}$ is the sum of two odd distinct primes. Numerical calculations extend this result for $2N$ in the range $8-3\times10^{6}$.…

We represent Mat\'ern functions in terms of Schoenberg's integrals which ensure the positive definiteness and prove the systems of translates of Mat\'ern functions form Riesz sequences in $L^2(\R^n)$ or Sobolev spaces. Our approach is based…

We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the…

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

We derive new integral representations for objects arising in the classical theory of elliptic functions: the Eisenstein series $E_s$, and Weierstrass' $\wp$ and $\zeta$ functions. The derivations proceed from the Laplace-Mellin…

In this paper, we prove an unconditional form of Fujii's formula for the average number of Goldbach representations and show that the error in this formula is determined by a general zero-free region of the Riemann zeta-function, and vice…

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

We introduce a generalized version of Orlicz premia, based on possibly non-convex loss functions. We show that this generalized definition covers a variety of relevant examples, such as the geometric mean and the expectiles, while at the…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

We prove a uniform estimate for sums of Hecke--Maass eigenvalues squared over primes in short intervals that can be regarded as an analogue of Hoheisel's classical prime number theorem for all real analytic cusp forms. Our argument is…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

We obtain asymptotic formulae for the second discrete moments of the Riemann zeta function over arithmetic progressions $\frac{1}{2} + i(a n + b)$. It reveals noticeable relation between the discrete moments and the continuous moment of the…

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…