fmpz_mod_poly_is_unit
Synopsis
#include <flint/fmpz_mod_poly.h>int fmpz_mod_poly_is_unit(const fmpz_mod_poly_t op, const fmpz_mod_ctx_t ctx)sourceReturns whether op is a constant that is invertible modulo n (or whether n = 1). For prime n these are exactly the units of (\mathbb{Z}/n\mathbb{Z})[x]; for composite n there are also nonconstant units, such as 1 + 2x modulo 4, which this function does not recognise.
Cite this page
The FLINT team, “fmpz_mod_poly_is_unit (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/fmpz_mod_poly_is_unit.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-is-unit,
author = {{The FLINT team}},
title = {{fmpz\_mod\_poly\_is\_unit (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/fmpz_mod_poly_is_unit.html},
note = {Generated 2026-10-20}
}