"Cramér's conjecture" meaning in All languages combined

{
  "etymology_text": "Formulated by the Swedish mathematician Harald Cramér in 1936.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Cramér's conjecture",
      "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": "Number theory",
          "orig": "en:Number theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An estimate for the size of gaps between consecutive prime numbers, stating that p_n+1-p_n=O(( log p_n)²), where pₙ denotes the nth prime number, O is big O notation, and log is the natural logarithm."
      ],
      "id": "en-Cramér's_conjecture-en-name-q9chLfco",
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "consecutive",
          "consecutive"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "big O notation",
          "big O notation"
        ],
        [
          "natural logarithm",
          "natural logarithm"
        ]
      ],
      "raw_glosses": [
        "(number theory) An estimate for the size of gaps between consecutive prime numbers, stating that p_n+1-p_n=O(( log p_n)²), where pₙ denotes the nth prime number, O is big O notation, and log is the natural logarithm."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "word": "Cramér's conjecture"
}

{
  "etymology_text": "Formulated by the Swedish mathematician Harald Cramér in 1936.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Cramér's conjecture",
      "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 terms spelled with É",
        "English terms spelled with ◌́",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Number theory"
      ],
      "glosses": [
        "An estimate for the size of gaps between consecutive prime numbers, stating that p_n+1-p_n=O(( log p_n)²), where pₙ denotes the nth prime number, O is big O notation, and log is the natural logarithm."
      ],
      "links": [
        [
          "number theory",
          "number theory"
        ],
        [
          "consecutive",
          "consecutive"
        ],
        [
          "prime number",
          "prime number"
        ],
        [
          "big O notation",
          "big O notation"
        ],
        [
          "natural logarithm",
          "natural logarithm"
        ]
      ],
      "raw_glosses": [
        "(number theory) An estimate for the size of gaps between consecutive prime numbers, stating that p_n+1-p_n=O(( log p_n)²), where pₙ denotes the nth prime number, O is big O notation, and log is the natural logarithm."
      ],
      "topics": [
        "mathematics",
        "number-theory",
        "sciences"
      ]
    }
  ],
  "word": "Cramér's conjecture"
}