bridge/class-master/depend/pari/src/basemath/ifactor1.c
/* Let x be a t_INT known not to have small divisors (< 2^14). Return 0 if x
 * is a proven composite. Return 1 if we believe it to be prime (fully proven
 * prime if factor_proven is set).  */
Let x be a t_INT known not to have small divisors (< 2^14). Return 0 if x
is a proven composite. Return 1 if we believe it to be prime (fully proven
prime if factor_proven is set).
Let x be a t_INT known not to have small divisors ( < 2^14 ) . Return 0 if x is a proven composite . Return 1 if we believe it to be prime ( fully proven prime if factor_proven is set ) .
int
ifac_isprime(GEN x)
{
  if (!BPSW_psp_nosmalldiv(x)) return 0; 
  if (factor_proven && ! BPSW_isprime(x))
  {
    pari_warn(warner,
              "IFAC: pseudo-prime %Ps\n\tis not prime. PLEASE REPORT!\n", x);
    return 0;
  }
  return 1;
}
int ifac_isprime ( GEN x ) { if ( ! BPSW_psp_nosmalldiv ( x ) ) return 0 ; if ( factor_proven && ! BPSW_isprime ( x ) ) { pari_warn ( warner , " \n \t \n " , x ) ; return 0 ; } return 1 ; }
Let x be a t_INT known not to have small divisors (< 2^14).
Let x be a t_INT known not to have small divisors ( < 2^14 ) .
/* composite */