padic_poly_mul
Synopsis
#include <flint/padic_poly.h>void padic_poly_mul(padic_poly_t res, const padic_poly_t poly1, const padic_poly_t poly2, const padic_ctx_t ctx)sourceSets res to the product of poly1 and poly2.
The integer parts are multiplied in \mathbb{Z}[x] with _fmpz_poly_mul (Multiplying polynomials over Z) and reduced modulo p^{N - v_1 - v_2}. No canonicalisation is needed: by Gauss's lemma the product of two polynomials that are nonzero modulo p is nonzero modulo p.
Cite this page
The FLINT team, “padic_poly_mul (padic_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/padic_poly/padic_poly_mul.html (generated 2026-10-20).
@misc{flint-doc-padic-poly-padic-poly-mul,
author = {{The FLINT team}},
title = {{padic\_poly\_mul (padic\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/padic_poly/padic_poly_mul.html},
note = {Generated 2026-10-20}
}