Related papers: M\"obius function and primes: an identity factory …

Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…

Let $\left[x\right]$ be the largest integer not exceeding $x$. For $0<\theta \leq 1$, let $\pi_{\theta}(x)$ denote the number of integers $n$ with $1 \leq n \leq x^{\theta}$ such that $\left[\frac{x}{n}\right]$ is prime and…

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…

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 $x\geq 1$ be a large integer, and let $\mu:\mathbb{N}\longrightarrow\{-1,0,1\}$ be the Mobius function. This article proposes an effective asymptotic result for the autocorrelation function $\sum_{n \leq x} \mu(n) \mu(n+t) =O\left(…

Let $M(x)=\sum_{1\le n\le x}\mu(n)$ where $\mu$ is the M\"obius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that $M(x)=O(x^{1/2+\epsilon})$ for all $\epsilon>0$. There has been much interest and…

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

We study the double sum $S_\varepsilon(X)$$=$$\sum_{\substack{d,e\le X}}\frac{\mu(d)\mu(e)}{[d,e]^{1+\varepsilon}}$, which converges even in the case $\varepsilon=0$, where $\mu$ denotes the M\"obius function and $[d,e]$ is the least common…

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

We study higher uniformity properties of the M\"obius function $\mu$, the von Mangoldt function $\Lambda$, and the divisor functions $d_k$ on short intervals $(X,X+H]$ with $X^{\theta+\varepsilon} \leq H \leq X^{1-\varepsilon}$ for a fixed…

We consider $\omega(n)$ and $\Omega(n)$, which respectively count the number of distinct and total prime factors of $n$. We survey a number of similarities and differences between these two functions, and study the summatory functions…

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

We study the sum $\sum_{abc \leq x} \Omega([a,b,c])$, where $\Omega(n)$ denotes the number of distinct prime divisors of $n \in \mathbb{Z}_{\geq 1}$, counted with multiplicity, and where $(a,b,c) = \gcd(a,b,c)$ and $[a,b,c] =…

Let $x$ be a positive integer. We give an asymptotic result for $\omega(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

We have for positive integers $n$, $k$ and finite field $\mathbb{F}_q$, $c(n,k,q)$, as the number of simultaneous similarity classes of $k$-tuples of commuting $n\times n$ matrices over the $\mathbb{F}_q$. In this paper, it has been shown…