🔢 mathematics
An Explicit Ramsey Bound for de Polignac Numbers
This paper establishes that the set of de Polignac numbers is a set with an explicitly computable bound and demonstrates that the natural numbers can be covered by a finite union of scaled de Polignac numbers determined by a set of size at most .
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.