See Gaussian moat on Wiktionary
{ "forms": [ { "form": "Gaussian moats", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Gaussian moat (plural Gaussian moats)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "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" } ], "examples": [ { "ref": "2006, Deanna Haunsperger, Stephen Kennedy, The Edge of the Universe: Celebrating Ten Years of Math Horizons, page 49:", "text": "If we can keep finding 'fatter and fatter' Gaussian moats surrounding the origin, then the prime-hiker will have to keep taking longer and longer steps.", "type": "quote" }, { "ref": "2020, Hector Florez, Sanjay Misra, Applied Informatics: Third International Conference, ICAI 2020, Ota, Nigeria, October 29–31, 2020, Proceedings, page 483:", "text": "The approach we follow is composed by three main components, each one defined by its own algorithm. The first one generates the necessary Gaussian primes, the second one calculates the Gaussian Moat, and the third one calculates the shortest paths.", "type": "quote" }, { "ref": "2022, Luca Dal Negro, Waves in Complex Media, page 372:", "text": "The Gaussian moat problem was posed originally by Basil Gordon in 1962 at the International Congress of Mathematicians held in Stockholm, […]", "type": "quote" } ], "glosses": [ "The maximum difference between consecutive numbers in a sequence of distinct Gaussian prime numbers." ], "id": "en-Gaussian_moat-en-noun-~X~p3Owy", "links": [ [ "number theory", "number theory" ], [ "maximum", "maximum" ], [ "difference", "difference" ], [ "consecutive", "consecutive" ], [ "sequence", "sequence" ], [ "distinct", "distinct" ], [ "Gaussian prime", "Gaussian prime" ] ], "raw_glosses": [ "(number theory) The maximum difference between consecutive numbers in a sequence of distinct Gaussian prime numbers." ], "topics": [ "mathematics", "number-theory", "sciences" ] } ], "word": "Gaussian moat" }
{ "forms": [ { "form": "Gaussian moats", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Gaussian moat (plural Gaussian moats)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "Pages with 1 entry", "Pages with entries", "en:Number theory" ], "examples": [ { "ref": "2006, Deanna Haunsperger, Stephen Kennedy, The Edge of the Universe: Celebrating Ten Years of Math Horizons, page 49:", "text": "If we can keep finding 'fatter and fatter' Gaussian moats surrounding the origin, then the prime-hiker will have to keep taking longer and longer steps.", "type": "quote" }, { "ref": "2020, Hector Florez, Sanjay Misra, Applied Informatics: Third International Conference, ICAI 2020, Ota, Nigeria, October 29–31, 2020, Proceedings, page 483:", "text": "The approach we follow is composed by three main components, each one defined by its own algorithm. The first one generates the necessary Gaussian primes, the second one calculates the Gaussian Moat, and the third one calculates the shortest paths.", "type": "quote" }, { "ref": "2022, Luca Dal Negro, Waves in Complex Media, page 372:", "text": "The Gaussian moat problem was posed originally by Basil Gordon in 1962 at the International Congress of Mathematicians held in Stockholm, […]", "type": "quote" } ], "glosses": [ "The maximum difference between consecutive numbers in a sequence of distinct Gaussian prime numbers." ], "links": [ [ "number theory", "number theory" ], [ "maximum", "maximum" ], [ "difference", "difference" ], [ "consecutive", "consecutive" ], [ "sequence", "sequence" ], [ "distinct", "distinct" ], [ "Gaussian prime", "Gaussian prime" ] ], "raw_glosses": [ "(number theory) The maximum difference between consecutive numbers in a sequence of distinct Gaussian prime numbers." ], "topics": [ "mathematics", "number-theory", "sciences" ] } ], "word": "Gaussian moat" }
Download raw JSONL data for Gaussian moat meaning in All languages combined (2.0kB)
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-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.