`gr_poly_factor_equal_deg_prob`

Synopsis#include <flint/gr_poly.h>

int gr_poly_factor_equal_deg_prob(gr_poly_t factor, flint_rand_t state, const gr_poly_t pol, slong d, gr_ctx_t ctx)source

One random trial of equal-degree factorisation: for a squarefree $f$ of degree $n = rd$ , $r \ge 2$ , all of whose irreducible factors have degree $d$ , tries to find a proper monic factor, written to factor (set to 1 on failure). A trial succeeds with probability roughly $1/2$ (at least $4/9$ ). Returns GR_DOMAIN if $d \nmid n$ or $n < 2$ .

Cite this page

The FLINT team, “gr_poly_factor_equal_deg_prob (gr_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_poly/gr_poly_factor_equal_deg_prob.html (generated 2026-11-02).

@misc{flint-doc-gr-poly-gr-poly-factor-equal-deg-prob,
  author       = {{The FLINT team}},
  title        = {{gr\_poly\_factor\_equal\_deg\_prob (gr\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/gr_poly/gr_poly_factor_equal_deg_prob.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95