2000 character limit reached
Théorème d'Erdős-Kac dans presque tous les petits intervalles
Published 18 Mar 2016 in math.NT | (1603.05809v2)
Abstract: We show that the Erd\H{o}s-Kac theorem is valid in almost all intervals $\left[x,x+h\right]$ as soon as $h$ tends to infinity with $x$. We also show that for all $k$ near $\log\log x$, almost all interval $\left[x,x+\exp\left(\left(\log\log x\right){1/2+\varepsilon}\right)\right]$ contains the expected number of integers $n$ such that $\omega(n)=k$. These results are a consequence of the methods introduced by Matom\"aki and Radziwi\l\l\ to estimate sums of multiplicative functions over short intervals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.