See Fermat pseudoprime in All languages combined, or Wiktionary
{ "forms": [ { "form": "Fermat pseudoprimes", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Fermat pseudoprime (plural Fermat pseudoprimes)", "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": "Mathematics", "orig": "en:Mathematics", "parents": [ "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "text": "341 is a Fermat pseudoprime to the base two.", "type": "example" } ], "glosses": [ "With respect to an integer base b, with b > 1, a composite integer n such that bⁿ⁻¹ is congruent to one modulo n." ], "id": "en-Fermat_pseudoprime-en-noun-eOmAGWf5", "links": [ [ "mathematics", "mathematics" ], [ "composite", "composite" ], [ "modulo", "modulo" ] ], "raw_glosses": [ "(mathematics) With respect to an integer base b, with b > 1, a composite integer n such that bⁿ⁻¹ is congruent to one modulo n." ], "topics": [ "mathematics", "sciences" ], "wikipedia": [ "Fermat pseudoprime" ] } ], "word": "Fermat pseudoprime" }
{ "forms": [ { "form": "Fermat pseudoprimes", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Fermat pseudoprime (plural Fermat pseudoprimes)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "English terms with usage examples", "Pages with 1 entry", "Pages with entries", "en:Mathematics" ], "examples": [ { "text": "341 is a Fermat pseudoprime to the base two.", "type": "example" } ], "glosses": [ "With respect to an integer base b, with b > 1, a composite integer n such that bⁿ⁻¹ is congruent to one modulo n." ], "links": [ [ "mathematics", "mathematics" ], [ "composite", "composite" ], [ "modulo", "modulo" ] ], "raw_glosses": [ "(mathematics) With respect to an integer base b, with b > 1, a composite integer n such that bⁿ⁻¹ is congruent to one modulo n." ], "topics": [ "mathematics", "sciences" ], "wikipedia": [ "Fermat pseudoprime" ] } ], "word": "Fermat pseudoprime" }
Download raw JSONL data for Fermat pseudoprime meaning in English (1.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.