The Hardy--Ramanujan inequality for sifted sets and its applications

TL;DR

This paper develops a weighted Hardy--Ramanujan inequality for sifted sets, extending previous results and applying it to various problems in number theory such as prime shifts, divisor functions, and the Carmichael function.

Contribution

It introduces a weighted inequality for sifted sets that generalizes earlier results and applies it to multiple classical problems in number theory.

Findings

Established a weighted Hardy--Ramanujan inequality for sifted sets.

Applied the inequality to problems involving shifted primes, divisor counts, and the Carmichael function.

Confirmed a weighted version of a 1992 conjecture related to the sum-of-proper-divisors function.

Abstract

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$, \[\#\{n\le x\colon\omega(n)=k\}\ll\frac{x(\log\log x+C)^{k-1}}{(k-1)!\log x}.\] A myriad of generalizations and variations of this inequality have been discovered. In this paper, we establish a weighted version of this inequality for sifted sets, which generalizes an earlier result of Hal\'asz and implies Timofeev's theorems on shifted primes. We then explore its applications to a variety of intriguing problems, such as large deviations of $\omega$ on subsets of integers, the Erd\H{o}s multiplication table problem, divisors of shifted primes, and the image of the Carmichael $\lambda$-function. Building on the same circle of ideas, we also generalize Troupe's result on the normal order of $\omega(s(n))$ for the sum-of-proper-divisors function $s(n)$, confirming for the first time the weighted version of a special case of a 1992 conjecture by Erd\H{o}s, Granville, Pomerance, and Spiro.