SearcharxivSearch

arXiv · 0909.0922

Azar y Aritmetica

Abstract

Let omega(n) be the number of prime divisors of an integer n. Let n be an integer taken at random between 1 and N. What can be said about the value then taken by omega(n)? What is its expected value? What is its distribution in the limit? What is the probability that omega(n) will deviate greatly from its expected value? We will study these questions as an introduction to probabilistic number theory. We treat several central topics in probabilistic number theory without assuming previous knowledge of the area. Neither measure theory nor complex analysis are assumed. In the exercises, among other topics, we develop some of the bases of sieve theory as an application of probabilistic ideas. ----- Sea omega(n) el numero de divisores primos de un entero n. Sea n un entero tomado al azar entre 1 y N. Que se puede decir del valor que entonces tomara' omega(n)? Cual es su esperanza? Cual es su distribucion en el limite? Cual es la probabilidad que omega(n) tome valores que se alejen mucho de su esperanza? Estudiamos estas preguntas a guisa de introduccion a la teoria de numeros probabilistica. Trataremos varios topicos centrales de la teoria de probabilidades sin suponer conocimientos previos en el area. No asumiremos ni teoria de la medida ni analisis complejo. En los ejercicios, entre otros topicos, se desarrollaran las bases de la teoria de cribas como una aplicacion de ideas probabilisticas.

Explore related subjects

Keep this discovery

BibTeXRIS

Harald Andres Helfgott. 2009-09-10. Azar y Aritmetica. https://arxiv.org/abs/0909.0922

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR