Related papers: Sieving and the Erd{\H o}s-Kac theorem

In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.

We prove an Erd\H{o}s-Kac type of theorem for the set $S(x,y)=\{n\leq x: p|n \Rightarrow p\leq y \}$. If $\omega (n)$ is the number of prime factors of $n$, we prove that the distribution of $\omega(n)$ for $n \in S(x,y)$ is Gaussian for a…

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…

The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations…

The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…

We study probability distributions arising from local obstructions to the existence of $p$-adic points in families of varieties. In certain cases we show that an Erd\H{o}s-Kac type law holds.

Let $x\geqslant 3$, for $1\leqslant n \leqslant x$ an integer, let $\omega(n)$ be its number of distinct prime factors. We show that, among the values $n\leqslant x$ with $\omega(n)=k$ where $1\leqslant k \ll \log_2 x$, $\omega(n-1)$…

We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…

We prove entropic and total variation versions of the Erd\H{o}s-Kac limit theorem for the maximum of the partial sums of i.i.d. random variables with densities.

Transforming the Erd\H{o}s-Kac theorem provides more flexibility in how the theorem can be utilized as an interval estimate for the prime omega function, which counts the number of distinct prime divisors. Here, we consider a direct…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.

In this paper we consider Erd\"os-Mordell inequality and its extension in the plane of triangle to the Erd\"os-Mordell curve. Algebraic equation of this curve is derived, and using modern computer tools in mathematics, we verified one…

For a quantum-mechanical counting process we show ergodicity, under the condition that the underlying open quantum system approaches equilibrium in the time mean. This implies equality of time average and ensemble average for correlation…

A very short and direct proof along the lines of the Kamae-Katznelson-Weiss approach.

Our goal in the present paper is to give a new ergodic proof of a well-known Veech's result, build upon our previous works.

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

We give an overview of issues surrounding computer-verified theorem proving in the standard pure-mathematical context. This is based on my talk at the PQR conference (Brussels, June 2003).

Cook's theorem is commonly expressed such as any polynomial time-verifiable problem can be reduced to the SAT problem. The proof of Cook's theorem consists in constructing a propositional formula A(w) to simulate a computation of TM, and…