bridge/class-master/depend/pari/src/basemath/FpX_factor.c
/* Use this function when you think f is reducible, and that there are lots of
 * factors. If you believe f has few factors, use FpX_nbfact(f,p)==1 instead */
Use this function when you think f is reducible, and that there are lots of
factors. If you believe f has few factors, use FpX_nbfact(f,p)==1 instead
Use this function when you think f is reducible and that there are lots of factors . If you believe f has few factors use FpX_nbfact ( f p ) == 1 instead
int
FpX_is_irred(GEN f, GEN p)
{
  pari_sp av = avma;
  int z;
  switch(ZX_factmod_init(&f,p))
  {
    case 0:  z = !!F2x_factor_i(f,2); break;
    case 1:  z = !!Flx_factor_i(f,p[2],2); break;
    default: z = !!FpX_factor_i(f,p,2); break;
  }
  avma = av; return z;
}
int FpX_is_irred ( GEN f , GEN p ) { pari_sp av = avma ; int z ; switch ( ZX_factmod_init ( & f , p ) ) { case 0 : z = ! ! F2x_factor_i ( f , 2 ) ; break ; case 1 : z = ! ! Flx_factor_i ( f , p [ 2 ] , 2 ) ; break ; default : z = ! ! FpX_factor_i ( f , p , 2 ) ; break ; } avma = av ; return z ; }
Use this function when you think f is reducible, and that there are lots of
 factors.
Use this function when you think f is reducible and that there are lots of factors .