<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en-US" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-science-frontier-research-f-mathematics-decision</journal-id>
<journal-title-group>
<journal-title>Global Journal of Science Frontier Research - F: Mathematics &amp; Decision</journal-title>
</journal-title-group>
<issn publication-format="print">0975-5896</issn>
<issn publication-format="electronic">2249-4626</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/115860.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">115860</article-id>
<title-group>
<article-title>Twin Prime Number Theorem</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Sha</surname><given-names>YinYue</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
</contrib-group>
<aff id="aff1">CHINA, Zhejiang University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2017-10-24">
<day>24</day>
<month>10</month>
<year>2017</year>
</pub-date>
<volume>17</volume>
<issue>F7</issue>
<abstract><p>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 { }.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>twin prime</kwd>
<kwd>bilateral sieve method.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJSFR_Volume17/4-Twin-Prime-Number-Theorem.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/twin-prime-number-theorem/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>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 { }.</p>
</sec>
</body>
</article>