n_primitive_root_prime, n_primitive_root_prime_prefactor
Synopsis
#include <flint/ulong_extras.h>ulong n_primitive_root_prime_prefactor(ulong p, n_factor_t * factors)sourceReturn a primitive root modulo the prime p. The prefactor version takes the prime factors q of p - 1 (exponents are ignored) and returns an a with a^{(p-1)/q} \ne 1 for every q given.
Cite this page
The FLINT team, “n_primitive_root_prime, n_primitive_root_prime_prefactor (ulong_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ulong_extras/n_primitive_root_prime.html (generated 2026-10-20).
@misc{flint-doc-ulong-extras-n-primitive-root-prime,
author = {{The FLINT team}},
title = {{n\_primitive\_root\_prime, n\_primitive\_root\_prime\_prefactor (ulong\_extras.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ulong_extras/n_primitive_root_prime.html},
note = {Generated 2026-10-20}
}