"greatest common divisor" meaning in All languages combined

See greatest common divisor on Wiktionary

Noun [Anglais]

Forms: greatest common divisors [plural]
  1. Plus grand commun diviseur.
    Sense id: fr-greatest_common_divisor-en-noun-LWZqlyrf Categories (other): Exemples en anglais, Lexique en anglais de l’arithmétique Topics: arithmetic
The following are not (yet) sense-disambiguated
{
  "categories": [
    {
      "kind": "other",
      "name": "Compositions en anglais",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Locutions nominales en anglais",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Anglais",
      "orig": "anglais",
      "parents": [],
      "source": "w"
    }
  ],
  "etymology_texts": [
    "Composé de greatest, common et divisor."
  ],
  "forms": [
    {
      "form": "greatest common divisors",
      "tags": [
        "plural"
      ]
    }
  ],
  "lang": "Anglais",
  "lang_code": "en",
  "pos": "noun",
  "pos_title": "Locution nominale",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Exemples en anglais",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Lexique en anglais de l’arithmétique",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "Ben Stephenson, The Python Workbook (2nde édition),Springer, 2019, page 133",
          "text": "Write a program that implements Euclid's algorithm and uses it to determine the greatest common divisor of two integers entered by the user.",
          "translation": "Écrivez un programme qui implémente l'algorithme d'Euclide et l'utilise pour déterminer le plus grand commun diviseur de deux entiers entrés par l'utilisateur."
        }
      ],
      "glosses": [
        "Plus grand commun diviseur."
      ],
      "id": "fr-greatest_common_divisor-en-noun-LWZqlyrf",
      "topics": [
        "arithmetic"
      ]
    }
  ],
  "word": "greatest common divisor"
}
{
  "categories": [
    "Compositions en anglais",
    "Locutions nominales en anglais",
    "anglais"
  ],
  "etymology_texts": [
    "Composé de greatest, common et divisor."
  ],
  "forms": [
    {
      "form": "greatest common divisors",
      "tags": [
        "plural"
      ]
    }
  ],
  "lang": "Anglais",
  "lang_code": "en",
  "pos": "noun",
  "pos_title": "Locution nominale",
  "senses": [
    {
      "categories": [
        "Exemples en anglais",
        "Lexique en anglais de l’arithmétique"
      ],
      "examples": [
        {
          "ref": "Ben Stephenson, The Python Workbook (2nde édition),Springer, 2019, page 133",
          "text": "Write a program that implements Euclid's algorithm and uses it to determine the greatest common divisor of two integers entered by the user.",
          "translation": "Écrivez un programme qui implémente l'algorithme d'Euclide et l'utilise pour déterminer le plus grand commun diviseur de deux entiers entrés par l'utilisateur."
        }
      ],
      "glosses": [
        "Plus grand commun diviseur."
      ],
      "topics": [
        "arithmetic"
      ]
    }
  ],
  "word": "greatest common divisor"
}

Download raw JSONL data for greatest common divisor meaning in All languages combined (0.9kB)


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 frwiktionary dump dated 2024-12-20 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.