"prime number theorem" meaning in English

{
  "forms": [
    {
      "form": "prime number theorems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "prime number theorem (plural prime number theorems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "_dis1": "48 52",
      "word": "prime-counting function"
    }
  ],
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "ref": "1932, A. E. Ingham, Albert Edward Ingham, The Distribution of Prime Numbers, Cambridge University Press, page 39:",
          "text": "But we cannot infer from them the equivalence in any sense of these two propositions, since we have used in our proof of the prime number theorem a subsidiary theorem on the order of magnitude of #x5C;zeta'(s)#x2F;#x5C;zeta(s).",
          "type": "quote"
        },
        {
          "text": "1974 [Academic Press], Harold M. Edwards, Riemann's Zeta Function, 2001, Dover, page 182,\nThe problem of locating the roots p of ζ, and consequently the problem of estimating the error in the prime number theorem, is closely related to the problem of estimating the growth of ζ in the critical strip 0<Res<1 as Ims→∞."
        },
        {
          "ref": "2016, Benjamin Fine, Gerhard Rosenberger, Number Theory: An Introduction via the Density of Primes, 2nd edition, Springer (Birkhäuser), page 145:",
          "text": "In 1859, Riemann attempted to give a complete proof of the prime number theorem using the zeta function for complex variables s. Although he was not successful in proving the prime number theorem he established many properties of the zeta function and showed that the prime number theorem depended on the zeros of the zeta function.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity."
      ],
      "id": "en-prime_number_theorem-en-noun-ASD6XT9Y",
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "asymptotic",
          "asymptotic"
        ],
        [
          "ln",
          "ln"
        ],
        [
          "infinity",
          "infinity"
        ]
      ],
      "raw_glosses": [
        "(number theory) The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "53 47",
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w+disamb"
        },
        {
          "_dis": "45 55",
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "ref": "1996, Illinois Journal of Mathematics, volume 40, University of Illinois Press, page 245:",
          "text": "In [6], [11], abstract prime number theorems are proved under a variety of conditions.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Any theorem that concerns the distribution of prime numbers."
      ],
      "id": "en-prime_number_theorem-en-noun-0WdxDl6K",
      "links": [
        [
          "number theory",
          "number theory"
        ]
      ],
      "raw_glosses": [
        "(number theory) Any theorem that concerns the distribution of prime numbers."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "prime number theorem"
  ],
  "word": "prime number theorem"
}

{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns",
    "Entries with translation boxes",
    "Pages with 1 entry",
    "Pages with entries"
  ],
  "forms": [
    {
      "form": "prime number theorems",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "prime number theorem (plural prime number theorems)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "prime-counting function"
    }
  ],
  "senses": [
    {
      "categories": [
        "English terms with quotations",
        "en:Number theory"
      ],
      "examples": [
        {
          "ref": "1932, A. E. Ingham, Albert Edward Ingham, The Distribution of Prime Numbers, Cambridge University Press, page 39:",
          "text": "But we cannot infer from them the equivalence in any sense of these two propositions, since we have used in our proof of the prime number theorem a subsidiary theorem on the order of magnitude of #x5C;zeta'(s)#x2F;#x5C;zeta(s).",
          "type": "quote"
        },
        {
          "text": "1974 [Academic Press], Harold M. Edwards, Riemann's Zeta Function, 2001, Dover, page 182,\nThe problem of locating the roots p of ζ, and consequently the problem of estimating the error in the prime number theorem, is closely related to the problem of estimating the growth of ζ in the critical strip 0<Res<1 as Ims→∞."
        },
        {
          "ref": "2016, Benjamin Fine, Gerhard Rosenberger, Number Theory: An Introduction via the Density of Primes, 2nd edition, Springer (Birkhäuser), page 145:",
          "text": "In 1859, Riemann attempted to give a complete proof of the prime number theorem using the zeta function for complex variables s. Although he was not successful in proving the prime number theorem he established many properties of the zeta function and showed that the prime number theorem depended on the zeros of the zeta function.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity."
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "asymptotic",
          "asymptotic"
        ],
        [
          "ln",
          "ln"
        ],
        [
          "infinity",
          "infinity"
        ]
      ],
      "raw_glosses": [
        "(number theory) The theorem that the number of prime numbers less than n asymptotically approaches n / ln(n) as n approaches infinity."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "Quotation templates to be cleaned",
        "en:Number theory"
      ],
      "examples": [
        {
          "ref": "1996, Illinois Journal of Mathematics, volume 40, University of Illinois Press, page 245:",
          "text": "In [6], [11], abstract prime number theorems are proved under a variety of conditions.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Any theorem that concerns the distribution of prime numbers."
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ]
      ],
      "raw_glosses": [
        "(number theory) Any theorem that concerns the distribution of prime numbers."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "prime number theorem"
  ],
  "word": "prime number theorem"
}