test whether a polynomial is primitive mod p - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Group Theory : Inert Functions : Primitive

Primitive - test whether a polynomial is primitive mod p

Calling Sequence

Primitive(a) mod p

Parameters

a

-

univariate polynomial

p

-

prime integer

Description

• 

Primitive(a) mod p returns true if the univariate polynomial a over the integers mod p is "primitive", and false otherwise.

• 

If a is an irreducible polynomial in Zp[x] then it is primitive if x is a primitive element in the finite field Zp[x]/(a) . Thus xi for i=1..pk1 is the set of all nonzero elements in the field.

Examples

Primitivex4+x+1mod2

true

(1)

Primitivex4+x3+x2+x+1mod2

false

(2)

See Also

Irreduc, Powmod


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam