Uses of Class
edu.jas.arith.ModInt
Packages that use ModInt
Package
Description
Basic arithmetic package.
Groebner bases using unique factorization package.
Unique factorization domain package.
-
Uses of ModInt in edu.jas.arith
Methods in edu.jas.arith that return ModIntModifier and TypeMethodDescriptionModInt.abs()
ModInt absolute value.ModIntRing.chineseRemainder
(ModInt c, ModInt ci, ModInt a) ModInt chinese remainder algorithm.ModInt.copy()
Clone this.Copy ModInt element c.ModIntRing.create
(int c) Create ModInt element c.Create ModInt element c.ModIntRing.create
(BigInteger c) Create ModInt element c.ModInt divide.ModInt[]
ModInteger extended greatest common divisor.ModIntRing.fromInteger
(int a) Get a ModInt element from a int value.ModIntRing.fromInteger
(long a) Get a ModInt element from a long value.ModIntRing.fromInteger
(BigInteger a) Get a ModInt element from a BigInteger value.ModInteger greatest common divisor.ModIntRing.getONE()
Get the one element.ModIntRing.getZERO()
Get the zero element.ModInt.inverse()
ModInt inverse.ModInt multiply.ModInt.negate()
ModInt negative.ModIntIterator.next()
Get next integer.Parse ModInt from Reader.Parse ModInt from String.ModIntRing.random
(int n) ModInt random.ModInt random.ModInt remainder.ModInt subtraction.ModInt summation.Methods in edu.jas.arith that return types with arguments of type ModIntModifier and TypeMethodDescriptionModular digit list chinese remainder algorithm.ModIntRing.generators()
Get a list of the generating elements.ModIntRing.iterator()
Get a ModInt iterator.Methods in edu.jas.arith with parameters of type ModIntModifier and TypeMethodDescriptionModIntRing.chineseRemainder
(ModInt c, ModInt ci, ModInt a) ModInt chinese remainder algorithm.Modular digit list chinese remainder algorithm.int
ModInt comparison.Copy ModInt element c.ModInt divide.ModInt[]
ModInteger extended greatest common divisor.ModInteger greatest common divisor.ModInt multiply.ModInt remainder.ModInt subtraction.ModInt summation.Method parameters in edu.jas.arith with type arguments of type ModInt -
Uses of ModInt in edu.jas.gbufd
Methods in edu.jas.gbufd that return types with arguments of type ModIntModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModInt> GBFactory.getImplementation
(ModIntRing fac) Determine suitable implementation of GB algorithms, case ModInt.static GroebnerBaseAbstract
<ModInt> GBFactory.getImplementation
(ModIntRing fac, PairList<ModInt> pl) Determine suitable implementation of GB algorithms, case ModInt.Method parameters in edu.jas.gbufd with type arguments of type ModIntModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModInt> GBFactory.getImplementation
(ModIntRing fac, PairList<ModInt> pl) Determine suitable implementation of GB algorithms, case ModInt. -
Uses of ModInt in edu.jas.ufd
Methods in edu.jas.ufd that return types with arguments of type ModIntModifier and TypeMethodDescriptionstatic FactorAbstract
<ModInt> FactorFactory.getImplementation
(ModIntRing fac) Determine suitable implementation of factorization algorithm, case ModInteger.static GreatestCommonDivisorAbstract
<ModInt> GCDFactory.getImplementation
(ModIntRing fac) Determine suitable implementation of gcd algorithms, case ModInt.static SquarefreeAbstract
<ModInt> SquarefreeFactory.getImplementation
(ModIntRing fac) Determine suitable implementation of factorization algorithm, case ModInt.static GreatestCommonDivisorAbstract
<ModInt> GCDFactory.getProxy
(ModIntRing fac) Determine suitable proxy for gcd algorithms, case ModInt.