Related papers: From explicit estimates for the primes to explicit…

Assuming the Riemann Hypothesis we establish an upper bound for the sum of the M{\" o}bius function up to $x$. Our method is based on estimating the frequency with which intervals of a given length can contain an unusual number of ordinates…

The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…

We show that, for the M\"obius function $\mu(n)$, we have $$ \sum_{x < n\leq x+x^{\theta}}\mu(n)=o(x^{\theta}) $$ for any $\theta>0.55$. This improves on a result of Ramachandra from 1976, which is valid for $\theta>7/12$. Ramachandra's…

Let $\gcd(m,n)$ denote the greatest common divisor of the positive integers $m$ and $n$, and let $\mu$ represent the M\" obius function. For any real number $x>5$, we define the summatory function of the M\" obius function involving the…

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…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

Let $\lambda$ the Barban--Vehov weights, defined in $(1)$. Let $X\ge z_1\ge100$ and $z_2=z_1^\tau$ for some $\tau>1$. We prove that \begin{equation*} \sum_{n\le X}\frac{1}{n}\Bigl(\sum_{\substack{d|n}}\lambda_d\Bigr)^2 \le f(\tau)\frac{\log…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

It is a folklore conjecture that the M\"obius function exhibits cancellation on shifted primes; that is, $\sum_{p\le X}\mu(p+h) \ = \ o(\pi(X))$ as $X\to\infty$ for any fixed shift $h>0$. This appears in print at least since Hildebrand in…

For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a…

We offer some comments on series involving the M$\ddot{o}$bius function which approximate sums over primes. To accomplish this, we utilize the derivative of the Gram series by applying Riemann-Stieltjes integration. We offer a new formula…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

Denote by $N(n)$ the number of integer solutions $(x_1,\,x_2,\ldots ,x_n)$ of the equation $x_1+x_2+\ldots+x_n=x_1x_2\cdot\ldots\cdot x_n$ such that $x_1\ge x_2\ge\ldots\ge x_n\ge 1$, $n \in \mathbb{Z}^+$. The aim of this paper are is…

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

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…

Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) =…

In this article, we study the summatory function \begin{equation*} W(x)=\sum_{n\leq x}(-2)^{\Omega(n)}, \end{equation*} where $\Omega(n)$ counts the number of prime factors of $n$, with multiplicity. We prove $W(x)=O(x)$, and in particular,…

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…