How to Submit
Browse
Events
Communities
About

Bounds in Twin Prime Distribution

24 February 2021, Version 1
Working Paper
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

An efficient numerical method of traversal of twin prime pairs was applied to verify bounds on the distribution of twin primes at an arbitrary distance. It was shown that if proven formally, the bounds will be sufficient for the proof of the twin prime conjecture. Heuristic arguments in favor of the bounds obtained with numerical modeling are given and connections with other problems in distributions of prime sequences briefly discussed.

Keywords

Prime numbers
Twin primes

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.

Version History

Feb 24, 2021 Version 1

Metrics

375
141
0
Views
Downloads
Citations

License

All Rights Reserved

DOI

10.33774/coe-2021-r149l
D O I: 10.33774/coe-2021-r149l [opens in a new tab]

Author’s competing interest statement

The author(s) have declared they have no conflict of interest with regard to this content

Ethics

The author(s) have declared ethics committee/IRB approval is not relevant to this content

Share