Search arXivSearch

arXiv · 2105.11020

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 $\mathcal S$ of density 1 such that \begin{equation}\liminf_{ \mathcal S\ni n\to\infty} (\log n)\mathbb{P} \{S_n\ \hbox{prime} \} \ge \frac{1}{\sqrt{2πe}\, }, \end{equation} and that for $b>\frac12$, the formula \begin{equation} \mathbb{P} \{S_n\ \text{prime}\, \} \, =\, \frac{ (1+ o( 1) )}{ \sqrt{2πB_n } } \int_{m_n-\sqrt{ 2bB_n\log n}}^{m_n+\sqrt{ 2bB_n\log n}} \, e^{-\frac{(t - m_n)^2}{ 2 B_n } }\, {\rm d}π(t), \end{equation} in which $m_n=\mathbb{E} S_n,B_n={\rm Var }\,S_n$, holds true for all $n\in \mathcal S$, $n\to \infty$. Further we prove that for any $0<η<1$, and all $n$ large enough and $ ζ_0\le ζ\le \exp\big\{ \frac{c\log n}{\log\log n}\big\}$, letting $S'_n= \sum_{j= 8}^n ξ_j$, \begin{eqnarray*} \mathbb{P}\big\{ S'_n\hbox{\ $ζ$-quasiprime}\big\} \,\ge \, (1-η) \frac{ e^{-γ} }{ \log ζ}, \end{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$, \begin{equation}\sup_{n\in I} \frac{|S_n-m_n|}{ \sqrt{B_n}}\le z, \end{equation} which are tied with the spectrum of the Sturm-Liouville equation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Weber. 2021-05-23. Critical probabilistic characteristics of the Cramér model for primes and arithmetical properties. https://arxiv.org/abs/2105.11020

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT