Uses of Class
edu.jas.arith.ModInteger
Packages that use ModInteger
Package
Description
Basic arithmetic package.
Factorization domain package for solvable polynomial rings.
Groebner bases using unique factorization package.
Generic coefficients polynomial package.
Unique factorization domain package.
-
Uses of ModInteger in edu.jas.arith
Methods in edu.jas.arith that return ModIntegerModifier and TypeMethodDescriptionModInteger.abs()
ModInteger absolute value.ModIntegerRing.chineseRemainder
(ModInteger c, ModInteger ci, ModInteger a) ModInteger chinese remainder algorithm.ModInteger.copy()
Clone this.ModIntegerRing.copy
(ModInteger c) Copy ModInteger element c.ModIntegerRing.create
(long c) Create ModInteger element c.Create ModInteger element c.ModIntegerRing.create
(BigInteger c) Create ModInteger element c.ModInteger.divide
(ModInteger S) ModInteger divide.ModInteger.egcd
(ModInteger S) ModInteger extended greatest common divisor.ModIntegerRing.fromInteger
(long a) Get a ModInteger element from a long value.ModIntegerRing.fromInteger
(BigInteger a) Get a ModInteger element from a BigInteger value.ModInteger.gcd
(ModInteger S) ModInteger greatest common divisor.ModIntegerRing.getONE()
Get the one element.ModIntegerRing.getZERO()
Get the zero element.ModInteger.hegcd
(ModInteger S) ModInteger half extended greatest common divisor.ModInteger.inverse()
ModInteger inverse.static ModInteger
ModInteger.MIABS
(ModInteger A) ModInteger absolute value.static ModInteger
ModInteger.MIDIF
(ModInteger A, ModInteger B) ModInteger subtraction.static ModInteger
ModInteger.MIINV
(ModInteger A) ModInteger inverse.static ModInteger
ModInteger.MINEG
(ModInteger A) ModInteger negative.static ModInteger
ModInteger.MIPROD
(ModInteger A, ModInteger B) ModInteger product.static ModInteger
ModInteger.MIQ
(ModInteger A, ModInteger B) ModInteger quotient.static ModInteger
ModInteger.MIREM
(ModInteger A, ModInteger B) ModInteger remainder.static ModInteger
ModInteger.MISUM
(ModInteger A, ModInteger B) ModInteger summation.ModInteger.multiply
(ModInteger S) ModInteger multiply.ModInteger.negate()
ModInteger negative.ModIntegerIterator.next()
Get next integer.Parse ModInteger from Reader.Parse ModInteger from String.ModInteger.quotientRemainder
(ModInteger S) Quotient and remainder by division of this by S.ModIntegerRing.random
(int n) ModInteger random.ModInteger random.ModInteger.remainder
(ModInteger S) ModInteger remainder.ModInteger.subtract
(ModInteger S) ModInteger subtraction.ModInteger.sum
(ModInteger S) ModInteger summation.Methods in edu.jas.arith that return types with arguments of type ModIntegerModifier and TypeMethodDescriptionstatic List
<ModInteger> ModIntegerRing.chineseRemainder
(ModInteger m1, ModInteger m2, List<ModInteger> L1, List<ModInteger> L2) Modular integer list chinese remainder algorithm.ModIntegerRing.generators()
Get a list of the generating elements.ModIntegerRing.iterator()
Get a ModInteger iterator.Methods in edu.jas.arith with parameters of type ModIntegerModifier and TypeMethodDescriptionModIntegerRing.chineseRemainder
(ModInteger c, ModInteger ci, ModInteger a) ModInteger chinese remainder algorithm.static List
<ModInteger> ModIntegerRing.chineseRemainder
(ModInteger m1, ModInteger m2, List<ModInteger> L1, List<ModInteger> L2) Modular integer list chinese remainder algorithm.int
ModInteger.compareTo
(ModInteger b) ModInteger comparison.ModIntegerRing.copy
(ModInteger c) Copy ModInteger element c.ModInteger.divide
(ModInteger S) ModInteger divide.ModInteger.egcd
(ModInteger S) ModInteger extended greatest common divisor.ModInteger.gcd
(ModInteger S) ModInteger greatest common divisor.ModInteger.hegcd
(ModInteger S) ModInteger half extended greatest common divisor.static ModInteger
ModInteger.MIABS
(ModInteger A) ModInteger absolute value.static int
ModInteger.MICOMP
(ModInteger A, ModInteger B) ModInteger comparison.static ModInteger
ModInteger.MIDIF
(ModInteger A, ModInteger B) ModInteger subtraction.static ModInteger
ModInteger.MIINV
(ModInteger A) ModInteger inverse.static ModInteger
ModInteger.MINEG
(ModInteger A) ModInteger negative.static ModInteger
ModInteger.MIPROD
(ModInteger A, ModInteger B) ModInteger product.static ModInteger
ModInteger.MIQ
(ModInteger A, ModInteger B) ModInteger quotient.static ModInteger
ModInteger.MIREM
(ModInteger A, ModInteger B) ModInteger remainder.static int
ModInteger.MISIGN
(ModInteger A) ModInteger signum.static ModInteger
ModInteger.MISUM
(ModInteger A, ModInteger B) ModInteger summation.ModInteger.multiply
(ModInteger S) ModInteger multiply.ModInteger.quotientRemainder
(ModInteger S) Quotient and remainder by division of this by S.ModInteger.remainder
(ModInteger S) ModInteger remainder.ModInteger.subtract
(ModInteger S) ModInteger subtraction.ModInteger.sum
(ModInteger S) ModInteger summation.Method parameters in edu.jas.arith with type arguments of type ModIntegerModifier and TypeMethodDescriptionstatic List
<ModInteger> ModIntegerRing.chineseRemainder
(ModInteger m1, ModInteger m2, List<ModInteger> L1, List<ModInteger> L2) Modular integer list chinese remainder algorithm. -
Uses of ModInteger in edu.jas.fd
Methods in edu.jas.fd that return types with arguments of type ModIntegerModifier and TypeMethodDescriptionSGCDFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of gcd algorithms, case ModInteger.SGCDFactory.getProxy
(ModIntegerRing fac) Determine suitable proxy for gcd algorithms, case ModInteger. -
Uses of ModInteger in edu.jas.gbufd
Methods in edu.jas.gbufd that return types with arguments of type ModIntegerModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModInteger> GBFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of GB algorithms, case ModInteger.static GroebnerBaseAbstract
<ModInteger> GBFactory.getImplementation
(ModIntegerRing fac, PairList<ModInteger> pl) Determine suitable implementation of GB algorithms, case ModInteger.SGBFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of GB algorithms, case ModInteger.SGBFactory.getImplementation
(ModIntegerRing fac, PairList<ModInteger> pl) Determine suitable implementation of GB algorithms, case ModInteger.Method parameters in edu.jas.gbufd with type arguments of type ModIntegerModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<ModInteger> GBFactory.getImplementation
(ModIntegerRing fac, PairList<ModInteger> pl) Determine suitable implementation of GB algorithms, case ModInteger.SGBFactory.getImplementation
(ModIntegerRing fac, PairList<ModInteger> pl) Determine suitable implementation of GB algorithms, case ModInteger. -
Uses of ModInteger in edu.jas.poly
Methods in edu.jas.poly that return types with arguments of type ModIntegerModifier and TypeMethodDescriptionstatic Product
<ModInteger> PolyUtil.toProduct
(ProductRing<ModInteger> pfac, BigInteger c) Product representation.static GenPolynomial
<Product<ModInteger>> PolyUtil.toProduct
(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A) Product representation.static List
<GenPolynomial<Product<ModInteger>>> PolyUtil.toProduct
(GenPolynomialRing<Product<ModInteger>> pfac, List<GenPolynomial<BigInteger>> L) Product representation.Method parameters in edu.jas.poly with type arguments of type ModIntegerModifier and TypeMethodDescriptionstatic Product
<ModInteger> PolyUtil.toProduct
(ProductRing<ModInteger> pfac, BigInteger c) Product representation.static GenPolynomial
<Product<ModInteger>> PolyUtil.toProduct
(GenPolynomialRing<Product<ModInteger>> pfac, GenPolynomial<BigInteger> A) Product representation.static List
<GenPolynomial<Product<ModInteger>>> PolyUtil.toProduct
(GenPolynomialRing<Product<ModInteger>> pfac, List<GenPolynomial<BigInteger>> L) Product representation. -
Uses of ModInteger in edu.jas.ufd
Methods in edu.jas.ufd that return types with arguments of type ModIntegerModifier and TypeMethodDescriptionstatic FactorAbstract
<ModInteger> FactorFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of factorization algorithm, case ModInteger.GCDFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of gcd algorithms, case ModInteger.static SquarefreeAbstract
<ModInteger> SquarefreeFactory.getImplementation
(ModIntegerRing fac) Determine suitable implementation of factorization algorithm, case ModInteger.GCDFactory.getProxy
(ModIntegerRing fac) Determine suitable proxy for gcd algorithms, case ModInteger.