next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
Divisor :: isDivPrime

isDivPrime -- Check if a divisor is prime

Synopsis

Description

Returns true if the divisor is prime (with coefficient 1), otherwise it returns false

i1 : R = QQ[x, y]

o1 = R

o1 : PolynomialRing
i2 : D1 = divisor(x^2 * y)

o2 = 1*Div(y) + 2*Div(x) of R

o2 : WDiv
i3 : D2 = divisor(x^2)

o3 = 2*Div(x) of R

o3 : WDiv
i4 : D3 = divisor(y)

o4 = 1*Div(y) of R

o4 : WDiv
i5 : isDivPrime( D1 )

o5 = false
i6 : isDivPrime( D2 )

o6 = false
i7 : isDivPrime( D3 )

o7 = true

Ways to use isDivPrime :