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. We prove that there exists a set of integers S of density 1 such that equation S n∞ ( n)P \Sn\ prime \ 12πe\, , equation and that for b>12, the formula equation P \Sn\ prime\, \ \, =\, (1+ o( 1) ) 2πBn ∫mn- 2bBn nmn+ 2bBn n \, e-(t - mn)2 2 Bn \, dπ(t), equation in which mn=E Sn,Bn= Var \,Sn, holds true for all n∈ S, n ∞. Further we prove that for any 0<η<1, and all n large enough and ζ0 ζ \ c n n\, letting S'n= Σj= 8n ξj, eqnarray* P\ S'n\ ζ-quasiprime\ \, \, (1-η) e-γ ζ, eqnarray* according 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 occurrences of intervals I such as for some z>0, equationn∈ I |Sn-mn| Bn z, equation which are tied with the spectrum of the Sturm-Liouville equation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.