fq_ctx_init
#include <flint/fq.h>Initialises ctx as a context for , , with the generator printed as var, a nonempty null-terminated string. The defining polynomial is the Conway polynomial for if it is in FLINT's table, and otherwise a random sparse irreducible polynomial (a trinomial or pentanomial if one is found). must be prime; this is not checked.
The table covers all primes below 110000 for some degrees: degrees up to 409 for and up to about 200 for , fewer for larger , and only above 11000 (see Defining polynomials). The random choice uses a fixed random state, so it is reproducible, but it depends on the FLINT version.
The FLINT team, “fq_ctx_init (fq.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq/fq_ctx_init.html (generated 2026-11-02).
@misc{flint-doc-fq-fq-ctx-init,
author = {{The FLINT team}},
title = {{fq\_ctx\_init (fq.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq/fq_ctx_init.html},
note = {Generated 2026-11-02}
}