bridge/class-master/depend/pari/src/basemath/ifactor1.c
/* no prime less than p divides n */
no prime less than p divides n
no prime less than p divides n
static int
special_primes(GEN n, ulong p, long *nb, GEN T)
{
  long i, l = lg(T);
  if (l > 1)
  { 
    long pp[] = { evaltyp(t_INT)|_evallg(4), 0,0,0 };
    pari_sp av = avma; affii(sqru(p), pp); avma = av;
    for (i = 1; i < l; i++)
      if (dvdiiz(n,gel(T,i), n))
      {
        long k = 1; while (dvdiiz(n,gel(T,i), n)) k++;
        STOREi(nb, gel(T,i), k);
        if (abscmpii(pp, n) > 0) return 1;
      }
  }
  return 0;
}
static int special_primes ( GEN n , ulong p , long * nb , GEN T ) { long i , l = lg ( T ) ; if ( l > 1 ) { long pp [ ] = { evaltyp ( t_INT ) | _evallg ( 4 ) , 0 , 0 , 0 } ; pari_sp av = avma ; affii ( sqru ( p ) , pp ) ; avma = av ; for ( i = 1 ; i < l ; i ++ ) if ( dvdiiz ( n , gel ( T , i ) , n ) ) { long k = 1 ; while ( dvdiiz ( n , gel ( T , i ) , n ) ) k ++ ; STOREi ( nb , gel ( T , i ) , k ) ; if ( abscmpii ( pp , n ) > 0 ) return 1 ; } } return 0 ; }
no prime less than p divides n
no prime less than p divides n
/* pp = square of biggest p tried so far */