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

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.

We introduce M\"obius functions of higher rank, a new class of arithmetic functions so that the classical M\"obius function is of rank 2. With this idea, we evaluate Dirichlet series on the sum of the reciprocal square of all $r$-free…

We derive a central limit theorem for sums of a function of independent sums of independent and identically distributed random variables. In particular we show that previously known result from Rempa\la and Weso\lowski (Statist. Probab.…

Using some simple combinatorial arguments, we establish some new estimates for the prime counting function and its allied functions. In particular we show that \begin{align}\pi(x)=\Theta(x)+O\bigg(\frac{1}{\log x}\bigg), \nonumber…

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

We discuss how one could study asymptotics of cyclotomic quantities via the mean values of certain multiplicative functions and their Dirichlet series using a theorem of Delange. We show how this could provide a new approach to Artin's…

Let $\omega$ be a non-negative function on $\mathbb{R}$. We are looking for a non-zero $f$ from a given space of entire functions $X$ satisfying $$(a) \quad|f|\leq \omega\text{\quad or\quad(b)}\quad |f|\asymp\omega.$$ The classical…

We study generalised prime systems $\mathcal{P}$ $(1<p_1\leq p_2\leq...,$ with $p_j\in\R$ tending to infinity) and the associated Beurling zeta function $\zeta_{\mathcal{P}}(s) =\prod_{j=1}^{\infty} (1-p_j^{-s})^{-1}$. Under appropriate…

Let $f(n)$ denote a multiplicative function with range $\{-1,0,1\}$, and let $F(x) = \sum_{n\leq x} f(n)$. Then $F(x)/\sqrt{x} = a\sqrt{x} + b + E(x)$, where $a$ and $b$ are constants and $E(x)$ is an error term that either tends to $0$ in…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

This paper concerns a long-standing problem raised by Beurling and Wintner on completeness of the dilation system $\{\varphi(kx):k=1,2,\cdots\}$ generated by the odd periodic extension on $\mathbb{R}$ of any $\varphi\in L^2[0,1]$. Up to now…

This paper analyzes the M\"obius ($\mu(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical M\"obius and…

The paper presents two arithmetical versions of the Nyman-Beurling equivalence with the Riemann hypothesis, proved by classical, quasi elementary, number-theoretic methods, based on an integrated version of the classical combinatorial…

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

We establish a connection between analytic number theory and computational learning theory by showing that the M\"obius function belongs to a class of functions that is statistically hard to learn from random samples. Let $\mu_R$ denote the…

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…