Abstract
The Open Path theory, supported by experimental data, is presented. The main hypothesis proposes that Prime Numbers's positions are determined by previous Prime Numbers as well as their spacing, in a complex, but deterministic way. The concepts of Open Path, Perfect Space, and Primorial Perfect Space are introduced. The Open Path theory can predict prime gaps of any minimum predetermined size. Two rudimentary algorithms based on this theory are presented. The first algorithm returns a sample (a few hundredth of numbers) containing 25 % of Prime Numbers at distances above 1011. The mirrored sample gives a similar percentage of Prime Numbers. The algorithm execution time is of a few milliseconds. The second algorithm presented determines if a number belonging to a Perfect Space is a composite number or a Prime Number.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
