GCD | R Documentation |
Find a monic polynomial of maximal degree that divides each of a set of polynomials exactly
GCD(...)
greatest_common_divisor(...)
## S3 method for class 'polynom'
GCD(...)
## S3 method for class 'polylist'
GCD(...)
... |
A list of polynomials or polylist objects |
A polynomial giving the greatest common divisor, as defined above
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))
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.