A note on the Polignac numbers
classification
🧮 math.NT
keywords
polignacadmissiblecontainsldotsleastnotenumbernumbers
read the original abstract
Suppose that $k\geq 3.5\times 10^6$ and $\hH=\{h_1,\ldots,h_{k_0}\}$ is admissible. Then for any $m\geq 1$, the set $$ \{m(h_j-h_i):\,h_i<h_j\} $$ contains at least one Polignac number.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.