User:Boris Tsirelson/sandbox
From Encyclopedia of Mathematics
< User:Boris Tsirelson
Revision as of 19:10, 18 March 2017 by Boris Tsirelson (talk | contribs)
You mean, how to prove that $S$ is dense, right? Well, on the page "Distribution of prime numbers", in Section 6 "The difference between prime numbers", we have $ d_n \ll p_n^\delta $, where $p_n$ is the $n$-th prime number, and $ d_n = p_{n+1}-p_n $ is the difference between adjacent prime numbers; this relation holds for all $ \delta > \frac{7}{12} $; in particular, taking $ \delta = 1 $ we get $ d_n \ll p_n $, that is, $ \frac{d_n}{p_n} \to 0 $ (as $ n \to \infty $), or equivalently, $ \frac{p_{n+1}}{p_n} \to 1 $. Now, your set $S$ consists of numbers $ 10^{-k} p_n $ for all $k$ and $n$ such that $ 10^{k-1} < p_n < 10^k $.
How to Cite This Entry:
Boris Tsirelson/sandbox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Boris_Tsirelson/sandbox&oldid=40263
Boris Tsirelson/sandbox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Boris_Tsirelson/sandbox&oldid=40263