Critical probabilistic characteristics of the Cramér model for primes and arithmetical properties

Abstract

This work is a probabilistic study of the 'primes' of the Cramér model, which consists with sums S n = ∑ n i=3 ξ i , n ≥ 3, where ξ i are independent random variables such that P{ξ i = 1} = 1 − P{ξ i = 1} = 1/log i, i ≥ 3. We prove that there exists a set of integers S of density 1 such that (0.0.1) lim infand that for b > 1 2 , the formula (0.0.2)Further we prove that for any 0 < η < 1, and all n large enough andaccording to Pintz's terminology, where c > 0 and γ is Euler's constant. We also test which infinite sequences of primes are ultimately avoided by the 'primes' of the Cramér model, with probability 1. Moreover we show that the Cramér model has incidences on the Prime Number Theorem, since it predicts that the error term is sensitive to subsequences. We obtain sharp results on the length and the number of occurences of intervals I such as for some z > 0, (0.0.3) sup n∈I |S n − m n | √ B n ≤ z, which are tied with the spectrum of the Sturm-Liouville equation.