"Bertrand-Chebyshev theorem" meaning in All languages combined

See Bertrand-Chebyshev theorem on Wiktionary

Proper name [English]

Etymology: From the surname of Joseph Louis François Bertrand, who conjectured the theorem, and the surname of Pafnuty Chebyshev who proved it. Head templates: {{en-proper noun}} Bertrand-Chebyshev theorem
  1. (mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.: Wikipedia link: Bertrand-Chebyshev theorem Categories (topical): Mathematics
    Sense id: en-Bertrand-Chebyshev_theorem-en-name-N4rAgTNT Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries Topics: mathematics, sciences
{
  "etymology_text": "From the surname of Joseph Louis François Bertrand, who conjectured the theorem, and the surname of Pafnuty Chebyshev who proved it.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Bertrand-Chebyshev theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "∀n∈ℕ:n>1⇒∃p∈ℙ:n<p<2n"
        }
      ],
      "glosses": [
        "the theorem that there is at least one prime number between n and 2n for every n>1, i.e."
      ],
      "id": "en-Bertrand-Chebyshev_theorem-en-name-N4rAgTNT",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "prime",
          "prime"
        ]
      ],
      "raw_glosses": [
        "(mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.:"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Bertrand-Chebyshev theorem"
      ]
    }
  ],
  "word": "Bertrand-Chebyshev theorem"
}
{
  "etymology_text": "From the surname of Joseph Louis François Bertrand, who conjectured the theorem, and the surname of Pafnuty Chebyshev who proved it.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Bertrand-Chebyshev theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "text": "∀n∈ℕ:n>1⇒∃p∈ℙ:n<p<2n"
        }
      ],
      "glosses": [
        "the theorem that there is at least one prime number between n and 2n for every n>1, i.e."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "prime",
          "prime"
        ]
      ],
      "raw_glosses": [
        "(mathematics) the theorem that there is at least one prime number between n and 2n for every n>1, i.e.:"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Bertrand-Chebyshev theorem"
      ]
    }
  ],
  "word": "Bertrand-Chebyshev theorem"
}

Download raw JSONL data for Bertrand-Chebyshev theorem meaning in All languages combined (1.0kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.