carl  24.04
Computer ARithmetic Library
LCM.h
Go to the documentation of this file.
1 #pragma once
2 
3 #include "GCD.h"
4 
5 namespace carl {
6 
7 template<typename C, typename O, typename P>
8 MultivariatePolynomial<C,O,P> lcm(const MultivariatePolynomial<C,O,P>& a, const MultivariatePolynomial<C,O,P>& b)
9 {
10  assert(!is_zero(a));
11  assert(!is_zero(b));
12  if (a == b) return a;
13  return quotient(a*b, gcd(a,b));
14 }
15 
16 }
carl
carl is the main namespace for the library.
carl::quotient
Interval< Number > quotient(const Interval< Number > &_lhs, const Interval< Number > &_rhs)
Implements the division with remainder.
Definition: Interval.h:1488
carl::gcd
cln::cl_I gcd(const cln::cl_I &a, const cln::cl_I &b)
Calculate the greatest common divisor of two integers.
Definition: operations.h:310
carl::is_zero
bool is_zero(const Interval< Number > &i)
Check if this interval is a point-interval containing 0.
Definition: Interval.h:1453
carl::lcm
cln::cl_I lcm(const cln::cl_I &a, const cln::cl_I &b)
Calculate the least common multiple of two integers.
Definition: operations.h:362
carl::MultivariatePolynomial
The general-purpose multivariate polynomial class.
Definition: MultivariatePolynomial.h:43