fq_nmod_multiplicative_order, fq_nmod_is_primitive
Synopsis
#include <flint/fq_nmod.h>int fq_nmod_multiplicative_order(fmpz * ord, const fq_nmod_t op, const fq_nmod_ctx_t ctx)int fq_nmod_is_primitive(const fq_nmod_t op, const fq_nmod_ctx_t ctx)Multiplicative order (returning 0 for zero, 1 for a primitive element and -1 otherwise) and primitivity test, as fq_multiplicative_order and fq_is_primitive.
Cite this page
The FLINT team, “fq_nmod_multiplicative_order, fq_nmod_is_primitive (fq_nmod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod/fq_nmod_multiplicative_order.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-fq-nmod-multiplicative-order,
author = {{The FLINT team}},
title = {{fq\_nmod\_multiplicative\_order, fq\_nmod\_is\_primitive (fq\_nmod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod/fq_nmod_multiplicative_order.html},
note = {Generated 2026-10-20}
}