fq_multiplicative_order
Synopsis
#include <flint/fq.h>The function factors with fmpz_factor, which can take a long time for large when has large prime factors, and then removes prime factors from as long as the power of op stays 1. This also tests whether a defining polynomial is primitive: its root fq_gen is primitive if and only if this function returns 1.
Cite this page
The FLINT team, “fq_multiplicative_order (fq.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq/fq_multiplicative_order.html (generated 2026-11-02).
@misc{flint-doc-fq-fq-multiplicative-order,
author = {{The FLINT team}},
title = {{fq\_multiplicative\_order (fq.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq/fq_multiplicative_order.html},
note = {Generated 2026-11-02}
}