Related papers: Beurling integers with RH and large oscillation

We approach a new proof of the strong Goldbach's conjecture for sufficiently large even integers by applying the Dirichlet's series. Using the Perron formula and the Residue Theorem in complex variable integration, one could show that any…

Standard prime-number counting functions, such as $\psi(x)$, $\theta(x)$, and $\pi(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $\pi_r(x) =…

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

We study the Dirichlet series associated with the integers whose radix-$b$ representation misses certain (fixed) digits. The existence of a meromorphic continuation to the entire complex plane, which was already well-known as a general fact…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

We find asymptotics for $S_{K,c}(x)$, the number of positive integers below $x$ whose number of prime factors is $c \; \mathrm{mod}\; K$. We study this question in the context of Beurling integers.

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

Beurling slow variation is generalized to Beurling regular variation. A Uniform Convergence Theorem, not previously known, is proved for those functions of this class that are measurable or have the Baire property. This permits their…

This is the first installment in a series of papers devoted to examining certain aspects of the asymptotic value distribution and distribution of zeros manifested by members of a broad class of linear combinations of L-functions in the…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

We show that Hal\'{a}sz's theorem holds for Beurling numbers under the following two mild hypotheses on the generalized number system: existence of a positive density for the generalized integers and a Chebyshev upper bound for the…

This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…

We survey the interplay between the Riesz means and Beurling moving averages of the title, obtaining Abelian and Tauberian results relating different Riesz means (or Beurling moving averages) whose defining functions have comparable growth.…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…