See Prouhet-Tarry-Escott problem on Wiktionary
Download JSON data for Prouhet-Tarry-Escott problem meaning in All languages combined (1.7kB)
{
"etymology_text": "Named after Eugène Prouhet, who studied it in the early 1850s, and Gaston Tarry and Escott, who studied it in the early 1910s.",
"head_templates": [
{
"args": {},
"expansion": "Prouhet-Tarry-Escott problem",
"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"
}
],
"glosses": [
"The problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k."
],
"id": "en-Prouhet-Tarry-Escott_problem-en-name-i~-VYbeB",
"links": [
[
"mathematics",
"mathematics"
],
[
"disjoint",
"disjoint"
],
[
"set",
"set"
],
[
"integer",
"integer"
]
],
"raw_glosses": [
"(mathematics) The problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k."
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Prouhet-Tarry-Escott problem"
]
}
],
"word": "Prouhet-Tarry-Escott problem"
}
{
"etymology_text": "Named after Eugène Prouhet, who studied it in the early 1850s, and Gaston Tarry and Escott, who studied it in the early 1910s.",
"head_templates": [
{
"args": {},
"expansion": "Prouhet-Tarry-Escott problem",
"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"
],
"glosses": [
"The problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"disjoint",
"disjoint"
],
[
"set",
"set"
],
[
"integer",
"integer"
]
],
"raw_glosses": [
"(mathematics) The problem of finding two disjoint sets A and B of n integers each, such that ∑_(a∈A)aⁱ=∑_(b∈B)bⁱ for each integer i from 1 to a given k."
],
"topics": [
"mathematics",
"sciences"
],
"wikipedia": [
"Prouhet-Tarry-Escott problem"
]
}
],
"word": "Prouhet-Tarry-Escott problem"
}
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-05-10 from the enwiktionary dump dated 2024-05-02 using wiktextract (a644e18 and edd475d). 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.