gcd_is_one() [2/2]

bool binomial_ring::gcd_is_one	(	monomial0	m,
		monomial0	n ) const

Definition at line 178 of file gb-toric.cpp.

{
  // Return true if supp(m), supp(n) have empty intersection
  for (int i = 0; i < nvars; i++)
    if (m[i] > 0 && n[i] > 0) return false;
  return true;
}

References monomial, and nvars.

Referenced by gcd_is_one().