See PGCD on Wiktionary
{
"anagrams": [
{
"word": "DGCP"
},
{
"word": "PGDC"
}
],
"categories": [
{
"kind": "other",
"name": "Lemmes en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Noms communs en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Sigles en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Traductions en anglais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Traductions en espéranto",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Traductions en portugais",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Français",
"orig": "français",
"parents": [],
"source": "w"
}
],
"etymology_texts": [
"(Sigle) Abréviation de plus grand commun diviseur."
],
"lang": "Français",
"lang_code": "fr",
"pos": "noun",
"pos_title": "Nom commun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Exemples en français",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Lexique en français des mathématiques",
"parents": [],
"source": "w"
}
],
"examples": [
{
"ref": "Michel Demazure, Cours d'Algèbre, Cassini, 2008, p. 38-39.",
"text": "En fait, une variante de l'algorithme d'Euclide permet de déterminer deux entiers x et y étant donnés, non seulement leur pgcd d, mais aussi deux entiers a et b tels que d = ax + by."
}
],
"glosses": [
"Plus grand commun diviseur."
],
"id": "fr-PGCD-fr-noun-LWZqlyrf",
"topics": [
"mathematics"
]
}
],
"sounds": [
{
"ipa": "\\pe.ʒe.se.de\\"
}
],
"tags": [
"invariable",
"masculine"
],
"translations": [
{
"lang": "Anglais",
"lang_code": "en",
"word": "GCD"
},
{
"lang": "Espéranto",
"lang_code": "eo",
"word": "PGKD"
},
{
"lang": "Portugais",
"lang_code": "pt",
"tags": [
"masculine"
],
"word": "MDC"
}
],
"word": "PGCD"
}
{
"anagrams": [
{
"word": "DGCP"
},
{
"word": "PGDC"
}
],
"categories": [
"Lemmes en français",
"Noms communs en français",
"Sigles en français",
"Traductions en anglais",
"Traductions en espéranto",
"Traductions en portugais",
"français"
],
"etymology_texts": [
"(Sigle) Abréviation de plus grand commun diviseur."
],
"lang": "Français",
"lang_code": "fr",
"pos": "noun",
"pos_title": "Nom commun",
"senses": [
{
"categories": [
"Exemples en français",
"Lexique en français des mathématiques"
],
"examples": [
{
"ref": "Michel Demazure, Cours d'Algèbre, Cassini, 2008, p. 38-39.",
"text": "En fait, une variante de l'algorithme d'Euclide permet de déterminer deux entiers x et y étant donnés, non seulement leur pgcd d, mais aussi deux entiers a et b tels que d = ax + by."
}
],
"glosses": [
"Plus grand commun diviseur."
],
"topics": [
"mathematics"
]
}
],
"sounds": [
{
"ipa": "\\pe.ʒe.se.de\\"
}
],
"tags": [
"invariable",
"masculine"
],
"translations": [
{
"lang": "Anglais",
"lang_code": "en",
"word": "GCD"
},
{
"lang": "Espéranto",
"lang_code": "eo",
"word": "PGKD"
},
{
"lang": "Portugais",
"lang_code": "pt",
"tags": [
"masculine"
],
"word": "MDC"
}
],
"word": "PGCD"
}
Download raw JSONL data for PGCD meaning in All languages combined (1.1kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-30 from the frwiktionary dump dated 2025-01-20 using wiktextract (bcd5c38 and 9dbd323). 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.