numtheory(deprecated)/primroot - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

Home : Support : Online Help : numtheory(deprecated)/primroot

numtheory(deprecated)

  

primroot

  

compute a primitive root

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

primroot(g, n)

primroot(n)

Parameters

g

-

positive integer or 0

n

-

integer greater than 1

Description

• 

Important: The numtheory package has been deprecated.  Use the superseding command NumberTheory[PrimitiveRoot] instead.

• 

The function primroot will compute the first primitive root of n that is greater than g, if possible, otherwise it returns FAIL.  The integers that are relatively prime to n form a group of order  under multiplication mod n. If this group is cyclic then a generator of the group is called a primitive root of n (i.e. the order of primroot (g, n) is ).  If only one argument n is present (in this case ) then this function will return the smallest primitive root of the number n.

• 

The command with(numtheory,primroot) allows the use of the abbreviated form of this command.

Examples

Important: The numtheory package has been deprecated.  Use the superseding command NumberTheory[PrimitiveRoot] instead.

(1)

(2)

(3)

(4)

(5)

(6)

(7)

See Also

NumberTheory[PrimitiveRoot]

numtheory(deprecated)[order]

numtheory(deprecated)[pprimroot]

 


Download Help Document