Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Théorème d'Erdős-Kac dans presque tous les petits intervalles (1603.05809v2)

Published 18 Mar 2016 in math.NT

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.

Summary

We haven't generated a summary for this paper yet.