The integers relatively prime to m form a group under multiplication modulo m, called the prime residue group. This chapter describes the functions that deal with this group.
The first section describes the function that computes the set of representatives of the group (see PrimeResidues).
The next sections describe the functions that compute the size and the exponent of the group (see Phi and Lambda).
The next section describes the function that computes the order of an element in the group (see OrderMod).
The next section describes the functions that test whether a residue generates the group or computes a generator of the group, provided it is cyclic (see IsPrimitiveRootMod, PrimitiveRootMod).
The next section describes the functions that test whether an element is a square in the group (see Jacobi and Legendre).
The next sections describe the functions that compute general roots in the group (see RootMod and RootsUnityMod).
All these functions are in the file LIBNAME/"numtheor.g".
GAP 3.4.4