n_polyu1n_mod_gcd_brown_smprime
Synopsis
#include <flint/n_poly.h>int n_polyu1n_mod_gcd_brown_smprime(n_polyun_t G, n_polyun_t Abar, n_polyun_t Bbar, n_polyun_t A, n_polyun_t B, nmod_t ctx, n_poly_polyun_stack_t St)sourceBrown's GCD algorithm for polynomials stored as n_polyun with one packed variable, with the same conventions as n_bpoly_mod_gcd_brown_smprime.
Cite this page
The FLINT team, “n_polyu1n_mod_gcd_brown_smprime (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_polyu1n_mod_gcd_brown_smprime.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-polyu1n-mod-gcd-brown-smprime,
author = {{The FLINT team}},
title = {{n\_polyu1n\_mod\_gcd\_brown\_smprime (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/n_polyu1n_mod_gcd_brown_smprime.html},
note = {Generated 2026-10-20}
}