GCD: Greatest common divisor

Description

Find a monic polynomial of maximal degree that divides each of a set of polynomials exactly

Usage

GCD(...)
greatest_common_divisor(...)
# S3 method for polynom
GCD(...)
# S3 method for polylist
GCD(...)

Arguments

...

A list of polynomials or polylist objects

Value

A polynomial giving the greatest common divisor, as defined above

Examples

Run this code

# NOT RUN {
p <- poly_calc(0:5)
r <- poly_calc(1:6)
greatest_common_divisor(p, r)
solve(greatest_common_divisor(p, r))
lowest_common_multiple(p, r)
solve(lowest_common_multiple(p, r))
# }

Run the code above in your browser using DataCamp Workspace