fq_zech_multiplicative_order, fq_zech_is_primitive
Synopsis
#include <flint/fq_zech.h>int fq_zech_multiplicative_order(fmpz * ord, const fq_zech_t op, const fq_zech_ctx_t ctx)int fq_zech_is_primitive(const fq_zech_t op, const fq_zech_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; the order of g^k is (q - 1)/\gcd(k, q - 1), but the generic algorithm, which factors q - 1, is used.
Cite this page
The FLINT team, “fq_zech_multiplicative_order, fq_zech_is_primitive (fq_zech.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_zech/fq_zech_multiplicative_order.html (generated 2026-10-20).
@misc{flint-doc-fq-zech-fq-zech-multiplicative-order,
author = {{The FLINT team}},
title = {{fq\_zech\_multiplicative\_order, fq\_zech\_is\_primitive (fq\_zech.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_zech/fq_zech_multiplicative_order.html},
note = {Generated 2026-10-20}
}