[Next] [Prev] [Right] [Left] [Up] [Index] [Root]
Creation Functions

Creation Functions

Subsections

Creation of Structures

ResidueClassRing(m) : RngIntElt -> RngIntRes
IntegerRing(m) : RngIntElt -> RngIntRes
Integers(m) : RngIntElt -> RngIntRes
Create the residue class ring Z/mZ.
ResidueClassRing(Q) : RngIntEltFact -> RngIntRes
IntegerRing(Q) : RngIntEltFact -> RngIntRes
Integers(Q) : RngIntEltFact -> RngIntRes
Create the residue class ring Z/mZ, where m is the integer corresponding to the factorization sequence Q. This is more efficient than creating the ring by m alone, since the factorization Q will be stored so it can be reused later.
quo< Z | m > : RngInt, RngIntElt -> RngIntRes
Given the ring of integers Z, and an integer m>1, create the residue class ring Z/mZ.

Creation of Elements

One(R) : RngIntRes -> RngIntResElt
Identity(R) : RngIntRes -> RngIntResElt
Zero(R) : RngIntRes -> RngIntResElt
Representative(R) : RngIntRes -> RngIntResElt
These generic functions create 1, 1, 0, and 0 respectively, in any Z/mZ.
elt< R | k > : RngIntRes, RngIntElt -> RngIntResElt
Create the residue class containing the integer k in residue class ring R.
R ! k : RngIntRes, RngIntElt -> RngIntResElt
Create the residue class containing k in the residue class ring R. Here k is allowed to be either an integer, or an element of the finite field F_p in the case R = Z/pZ, or an element of S = Z/nZ for a multiple or divisor n of m (with R = Z/mZ).
Random(R) : RngIntRes -> RngIntResElt
Create a `random' residue class in R.
[Next] [Prev] [Right] [Left] [Up] [Index] [Root]