"Bertrand-Chebyshev theorem" meaning in English

{
  "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "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.:",
        "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-aglHzgCm",
      "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "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.:",
        "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"
}