[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: PrimaryIdeal .. Primes
PrimaryIdeal(R) : RngInvar -> RngMPol
PrimaryInvariantFactors(a) : AlgMatElt -> [ <RngUPolElt, RngIntElt ]
PrimaryInvariantFactors(A) : Mtrx -> [ <RngUPolElt, RngIntElt> ]
R`PrimaryInvariants
PrimaryInvariants(A) : GrpAb -> [ RngIntElt ]
PrimaryInvariants(R) : RngInvar -> [ RngMPolElt ]
PrimaryRationalForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
PrimaryRationalForm(A) : Mtrx -> AlgMatElt, AlgMatElt, [ <RngUPolElt, RngIntElt ]
DegreeOnePrimeIdeals(O, B) : RngOrd, RngIntElt -> [ RngOrdIdl ]
DifferentiationSequence(x, n, a) : FldFunGElt, RngIntElt, FldFunGElt -> SeqEnum
IsPrime(x) : RngElt -> BoolElt
IsPrime(I) : RngFunOrdIdl -> BoolElt
IsPrime(n) : RngIntElt -> BoolElt
IsPrime(n) : RngIntElt -> BoolElt
IsPrime(I) : RngMPol -> BoolElt
IsPrime(I) : RngMPolRes -> BoolElt
IsPrime(I) : RngOrdIdl -> BoolElt, RngOrdIdl
IsPrimePower(n) : RngIntElt -> BoolElt, RngIntElt, RngIntElt
IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
KeepPrimePower(SQP, p) : SQProc, RngIntElt -> SeqEnum
NextPrime(n) : RngIntElt -> RngIntElt
NumberOfPrimePolynomials(q, d) : RngIntElt, RngIntElt -> RngIntElt
PreviousPrime(n) : RngIntElt -> RngIntElt
Prime(M) : ModSS -> RngIntElt
Prime(L) : RngPad -> RngIntElt
Prime(G) : SymGenLoc -> RngIntElt
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeComponents(X) : Sch -> SeqEnum
PrimeField(F) : Fld -> Fld
PrimeField(F) : FldFin -> FldFin
PrimeForm(Q, p) : QuadBin, RngIntElt -> QuadBinElt
PrimeIdeal(S, p) : AlgQuatOrd, RngIntElt -> AlgQuatOrd
PrimePolynomials(R, d) : RngUPol, RngIntElt -> SeqEnum[ RngUPolElt ]
PrimeRing(F) : FldFun -> Rng
PrimeRing(R) : Rng -> Rng
PrimeRing(L) : RngPad -> RngPad
RandomPrime(n: parameter) : RngIntElt -> RngIntElt
RandomPrime(n: parameter) : RngIntElt -> RngIntElt
RandomPrime(n, a, b, x: parameter) :RngIntElt, RngIntElt, RngIntElt -> BoolElt, RngIntElt
RandomPrime(n, a, b, x: parameter) :RngIntElt, RngIntElt, RngIntElt -> BoolElt, RngIntElt
RandomPrimePolynomial(R, d) : RngUPol, RngIntElt -> RngUPolElt
Functions on Prime Ideals (ALGEBRAIC FUNCTION FIELDS)
Predicates on Prime Ideals (ALGEBRAIC FUNCTION FIELDS)
Primes and Primality Testing (RING OF INTEGERS)
PrimeDivisors(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeComponents(X) : Sch -> SeqEnum
PrimeDivisors(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeBasis(n) : RngIntElt -> [RngIntElt]
PrimeField(F) : Fld -> Fld
PrimeField(F) : FldFin -> FldFin
PrimeRing(F) : FldFun -> Rng
PrimeRing(L) : RngPad -> RngPad
PrimeForm(Q, p) : QuadBin, RngIntElt -> QuadBinElt
PrimeIdeal(S, p) : AlgQuatOrd, RngIntElt -> AlgQuatOrd
PrimePolynomials(R, d) : RngUPol, RngIntElt -> SeqEnum[ RngUPolElt ]
PrimePowerRepresentation(x, k, a) : FldFunGElt, RngIntElt, FldFunGElt -> SeqEnum
DifferentiationSequence(x, n, a) : FldFunGElt, RngIntElt, FldFunGElt -> SeqEnum
PrimeField(F) : FldFun -> Rng
PrimeRing(F) : FldFun -> Rng
PrimeRing(R) : Rng -> Rng
PrimeRing(L) : RngPad -> RngPad
AddPrimes(SQP, p): SQProc, RngIntElt ->
BadPrimes(C) : CrvCon -> SeqEnum
BadPrimes(E) : CrvEll -> [ RngIntElt ]
BadPrimes(C) : CrvHyp -> SeqEnum
BadPrimes(J) : JacHyp -> SeqEnum
ExtensionPrimes(D, Q) : DB, MonStgElt -> SetEnum
GModulePrimes(G, A) : GrpFP, GrpFP -> SetMulti
GModulePrimes(G, A, B) : GrpFP, GrpFP, GrpFP -> SetMulti
GModulePrimes(G, A) : GrpGPC, GrpGPC -> SetMulti
GModulePrimes(G, A, B) : GrpGPC, GrpGPC, GrpGPC -> SetMulti
GetPrimes(SQP) : SQProc -> SetEnum, BoolElt
Primes(SQP): SQProc ->
PrintPrimes(SQP) : SQProc ->
RamifiedPrimes(A) : AlgQuat -> SeqEnum
ReplacePrimes(SQP, m): SQProc, SetEnum ->
[____] [____] [_____] [____] [__] [Index] [Root]