Related papers: On the estimate $M(x)=o(x)$ for Beurling generaliz…

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

We consider an Ornstein-Uhleneck (OU) process associated to self-normalised sums in i.i.d. symmetric random variables from the domain of attraction of $N(0, 1)$ distribution. We proved the self-normalised sums converge to the OU process (in…

Given an ergodic dynamical system $(X, \mathcal{B}, \mu, T)$, we prove that for each function $f$ belonging to the Orlicz space $L(\log L)^2(\log \log L)(X, \mu)$, the ergodic averages \[ \frac{1}{\pi(N)} \sum_{p \in \mathbb{P}_N} f\big(T^p…

We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…

$L$ functions based on Dirichlet characters are natural generalizations of the Riemann $\zeta(s)$ function: they both have series representations and satisfy an Euler product representation, i.e. an infinite product taken over prime…

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…

By $BMO_o(R)$ we denote the space consisting of all those odd and bounded mean oscillation functions on R. In this paper we characterize the functions in $BMO_o(R)$ with bounded support as those ones that can be written as a sum of a…

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

We study the distribution of zeros of zeta functions associated to Beurling generalized prime number systems whose integers are distributed as $N(x) = Ax + O(x^{\theta})$. We obtain in particular \[ N(\alpha, T) \ll…

We obtain asymptotic formulas for the $2k$th moments of partially smoothed divisor sums of the M\"obius function. When $2k$ is small compared with $A$, the level of smoothing, then the main contribution to the moments come from integers…

In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…

We study the $M$-functions, which describe the limit theorem for the value-distributions of the secondary main terms in the asymptotic formulas for the summatory functions of the Goldbach counting function. One of the new aspects is a…

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

We consider a multiple arithmetical sum involving the Moebius function which despite its elementary appearance is in fact of a highly intriguing nature. We establish an asymptotic formula for the quadruple case that raises the first…

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…