5 #include <CoCoA/library.H>
8 namespace cocoawrapper {
10 CoCoA::RingElem
gcd(
const CoCoA::RingElem& p,
const CoCoA::RingElem& q) {
13 CoCoA::factorization<CoCoA::RingElem> factor(
const CoCoA::RingElem& p) {
14 return CoCoA::factor(p);
16 std::vector<CoCoA::RingElem> ReducedGBasis(
const std::vector<CoCoA::RingElem>& p) {
17 return CoCoA::ReducedGBasis(CoCoA::ideal(p));
19 CoCoA::factorization<CoCoA::RingElem> SqFreeFactor(
const CoCoA::RingElem& p) {
20 return CoCoA::factor(p);
carl is the main namespace for the library.
cln::cl_I gcd(const cln::cl_I &a, const cln::cl_I &b)
Calculate the greatest common divisor of two integers.