347 Print(
"ncSA_1xy0x0yG(var(%d)^{%d}, var(%d)^{%d}, G, r)!\n",
j,
m,
i, n);
348 number t =
n_Copy(m_g, r->cf);
356 number c =
n_Init(1, r->cf);
375 number t =
n_Init(km + 1, r->cf);
380 t =
n_Init(kn + 1, r->cf);
385 c =
n_Div(c, t, r->cf);
404 assume((km == 0) || (kn == 0) );
411 number t =
n_Init(km + 1, r->cf);
418 number t =
n_Init(kn + 1, r->cf);
424 c =
n_Div(c, t, r->cf);
static poly pLast(poly a, int &length)
returns the length of a polynomial (numbers of monomials) respect syzComp
static int min(int a, int b)
static int si_min(const int a, const int b)
static FORCE_INLINE void n_InpMult(number &a, number b, const coeffs r)
multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
void PrintS(const char *s)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
static void p_Setm(poly p, const ring r)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'