Twin Prime Number Theorem
twin prime, bilateral sieve method
Abstract
Let Pt(N) be the number of twin primes less than or equal to N, Pi (3 Pi Pm) be taken over the odd primes less than or equal to √N, then exists the formula as follows: Pt(N) ≥ INT { N×(1-1/2)×Π (1-2/Pi) } - 2 ≥ INT { Ct×2N/(Ln (N))^2 } - 2 Pt(N) ≥ INT { 0.660×2N/(Ln (N))^2 } - 2 ≥ 0.660×2N/(Ln (N))^2 - 3 Π ( Pi(Pi-2)/(Pi-1)^2 ) ≥ Ct = 0.6601618158… Where the INT { } expresses the taking integer operation of formula spread out type in { }.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
References
Published
2017-11-20
Issue
Section
License
Copyright (c) 2017 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.