Uses of Class
edu.jas.arith.BigInteger
Packages that use BigInteger
Package
Description
Groebner base application package.
Basic arithmetic package.
Factorization domain package for solvable polynomial rings.
Groebner bases package.
Groebner bases using unique factorization package.
Generic coefficients polynomial package.
Generic coefficients power series package.
Real and Complex Root Computation package.
Unique factorization domain package.
-
Uses of BigInteger in edu.jas.application
Fields in edu.jas.application with type parameters of type BigIntegerModifier and TypeFieldDescription(package private) PolynomialList
<BigInteger> IntegerProgram.F
(package private) Ideal
<BigInteger> IntegerProgram.GB
(package private) Ideal
<BigInteger> IntegerProgram.I
(package private) GenPolynomial
<BigInteger> IntegerProgram.S
-
Uses of BigInteger in edu.jas.arith
Fields in edu.jas.arith declared as BigIntegerModifier and TypeFieldDescription(package private) BigInteger
BigRationalIterator.den
(package private) BigInteger
BigRationalIterator.num
static final BigInteger
BigInteger.ONE
The constant 1.static final BigInteger
BigInteger.TWO
The constant 2.static final BigInteger
BigInteger.ZERO
The constant 0.Fields in edu.jas.arith with type parameters of type BigIntegerModifier and TypeFieldDescription(package private) Iterator
<BigInteger> BigRationalIterator.denit
(package private) List
<BigInteger> BigRationalIterator.denlist
(package private) Iterator
<BigInteger> BigRationalIterator.denlistit
(package private) Iterator
<BigInteger> BigRationalIterator.numit
(package private) List
<BigInteger> BigRationalIterator.numlist
(package private) Iterator
<BigInteger> BigRationalIterator.numlistit
Methods in edu.jas.arith that return BigIntegerModifier and TypeMethodDescriptionBigInteger.abs()
Absolute value of this.static BigInteger
Combinatoric.binCoeff
(int n, int k) Integer binomial coefficient.static BigInteger
Combinatoric.binCoeffInduction
(BigInteger A, long n, long k) Integer binomial coefficient induction.static BigInteger
Combinatoric.binCoeffSum
(int n, int k) Integer binomial coefficient partial sum.BigInteger.copy()
Clone this.BigInteger.copy
(BigInteger c) Copy BigInteger element c.BigInteger.divide
(BigInteger S) BigInteger divide.BigInteger.egcd
(BigInteger S) BigInteger extended greatest common divisor.static BigInteger
Combinatoric.factorial
(long n) Factorial.BigInteger.factory()
Get the corresponding element factory.BigInteger.fromInteger
(long a) Get a BigInteger element from long.BigInteger.fromInteger
(BigInteger a) Get a BigInteger element from a math.BigInteger.BigInteger.gcd
(BigInteger S) BigInteger greatest common divisor.ModInt.getInteger()
Return a BigInteger from this Element.ModInteger.getInteger()
Return a BigInteger from this Element.ModLong.getInteger()
Return a BigInteger from this Element.Modular.getInteger()
Return a BigInteger from this Element.ModIntegerRing.getIntegerModul()
Get the module part as BigInteger.ModIntRing.getIntegerModul()
Get the module part as BigInteger.ModLongRing.getIntegerModul()
Get the module part as BigInteger.ModularRingFactory.getIntegerModul()
Return the BigInteger modul for the factory.BigInteger.getONE()
Get the one element.ModInt.getSymmetricInteger()
Return a symmetric BigInteger from this Element.ModInteger.getSymmetricInteger()
Return a symmetric BigInteger from this Element.ModLong.getSymmetricInteger()
Return a symmetric BigInteger from this Element.Modular.getSymmetricInteger()
Return a symmetric BigInteger from this Element.BigInteger.getZERO()
Get the zero element.static BigInteger
BigInteger.IABS
(BigInteger A) Absolute value.static BigInteger
BigInteger.IDIF
(BigInteger A, BigInteger B) BigInteger subtract.static BigInteger
BigInteger.IGCD
(BigInteger A, BigInteger B) BigInteger greatest common divisor.static BigInteger
BigInteger.INEG
(BigInteger A) Negative value.BigInteger.inverse()
Integer inverse.static BigInteger
BigInteger.IPROD
(BigInteger A, BigInteger B) BigInteger multiply.static BigInteger
BigInteger.IQ
(BigInteger A, BigInteger B) BigInteger divide.static BigInteger[]
BigInteger.IQR
(BigInteger A, BigInteger B) Integer quotient and remainder.static BigInteger
BigInteger.IRAND
(int NL) BigInteger random.static BigInteger
BigInteger.IREM
(BigInteger A, BigInteger B) BigInteger remainder.static BigInteger
BigInteger.ISUM
(BigInteger A, BigInteger B) BigInteger addition.BigInteger.multiply
(BigInteger S) BigInteger multiply.BigInteger.negate()
BigIntegerIterator.next()
Get next integer.BigInteger parse from Reader.BigInteger parse from String.BigInteger.quotientRemainder
(BigInteger S) BigInteger compute quotient and remainder.BigInteger.random
(int n) BigInteger random.BigInteger random.BigInteger.remainder
(BigInteger S) BigInteger remainder.static BigInteger
Roots.root
(BigInteger A, int n) Integer n-th root.BigInteger.shiftLeft
(int n) BigInteger shift left.static BigInteger
Roots.sqrt
(BigInteger A) Integer square root.static BigInteger
Roots.sqrtInt
(BigInteger A) Integer square root.BigInteger.subtract
(BigInteger S) BigInteger subtract.BigInteger.sum
(BigInteger S) BigInteger summation.static BigInteger
BigInteger.valueOf
(long a) Get a BigInteger element from long.static BigInteger
BigInteger.valueOf
(BigInteger a) Get a BigInteger element from a math.BigInteger.Methods in edu.jas.arith that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionstatic List
<BigInteger> ArithUtil.continuedFraction
(BigRational A) Continued fraction.BigInteger.generators()
Get a list of the generating elements.BigInteger.iterator()
Get a BigInteger iterator.Methods in edu.jas.arith with parameters of type BigIntegerModifier and TypeMethodDescriptionstatic BigInteger
Combinatoric.binCoeffInduction
(BigInteger A, long n, long k) Integer binomial coefficient induction.int
BigInteger.compareTo
(BigInteger b) Compare to BigInteger b.BigInteger.copy
(BigInteger c) Copy BigInteger element c.BigInteger.divide
(BigInteger S) BigInteger divide.BigInteger.egcd
(BigInteger S) BigInteger extended greatest common divisor.BigRational.fromInteger
(BigInteger a) Get a BigRational element from a arith.BigInteger.BigInteger.gcd
(BigInteger S) BigInteger greatest common divisor.static BigInteger
BigInteger.IABS
(BigInteger A) Absolute value.static int
BigInteger.ICOMP
(BigInteger A, BigInteger B) Integer comparison.static BigInteger
BigInteger.IDIF
(BigInteger A, BigInteger B) BigInteger subtract.static BigInteger
BigInteger.IGCD
(BigInteger A, BigInteger B) BigInteger greatest common divisor.static BigInteger
BigInteger.INEG
(BigInteger A) Negative value.static BigInteger
BigInteger.IPROD
(BigInteger A, BigInteger B) BigInteger multiply.static BigInteger
BigInteger.IQ
(BigInteger A, BigInteger B) BigInteger divide.static BigInteger[]
BigInteger.IQR
(BigInteger A, BigInteger B) Integer quotient and remainder.static BigInteger
BigInteger.IREM
(BigInteger A, BigInteger B) BigInteger remainder.static int
BigInteger.ISIGN
(BigInteger A) Integer signum.static BigInteger
BigInteger.ISUM
(BigInteger A, BigInteger B) BigInteger addition.BigInteger.multiply
(BigInteger S) BigInteger multiply.BigInteger.quotientRemainder
(BigInteger S) BigInteger compute quotient and remainder.BigInteger.remainder
(BigInteger S) BigInteger remainder.static BigInteger
Roots.root
(BigInteger A, int n) Integer n-th root.static BigInteger
Roots.sqrt
(BigInteger A) Integer square root.static BigInteger
Roots.sqrtInt
(BigInteger A) Integer square root.BigInteger.subtract
(BigInteger S) BigInteger subtract.BigInteger.sum
(BigInteger S) BigInteger summation.Method parameters in edu.jas.arith with type arguments of type BigIntegerModifier and TypeMethodDescriptionstatic BigRational
ArithUtil.continuedFractionApprox
(List<BigInteger> A) Continued fraction approximation.Constructors in edu.jas.arith with parameters of type BigIntegerModifierConstructorDescriptionConstructor for a BigRational from jas.arith.BigIntegers.BigRational
(BigInteger n, BigInteger d) Constructor for a BigRational from jas.arith.BigIntegers. -
Uses of BigInteger in edu.jas.fd
Methods in edu.jas.fd that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionSGCDFactory.getImplementation
(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.SGCDFactory.getProxy
(BigInteger fac) Determine suitable proxy for gcd algorithms, case BigInteger.Methods in edu.jas.fd with parameters of type BigIntegerModifier and TypeMethodDescriptionSGCDFactory.getImplementation
(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.SGCDFactory.getProxy
(BigInteger fac) Determine suitable proxy for gcd algorithms, case BigInteger. -
Uses of BigInteger in edu.jas.gb
Fields in edu.jas.gb with type parameters of type BigIntegerMethods in edu.jas.gb that return types with arguments of type BigIntegerModifier and TypeMethodDescription(package private) GenPolynomial
<BigInteger> Cyclic.cyclicPoly
(GenPolynomialRing<BigInteger> ring, int n, int i) Cyclic.cyclicPolys()
Compute list of polynomials.(package private) List
<GenPolynomial<BigInteger>> Cyclic.cyclicPolys
(GenPolynomialRing<BigInteger> ring) Compute list of polynomials.Method parameters in edu.jas.gb with type arguments of type BigIntegerModifier and TypeMethodDescription(package private) GenPolynomial
<BigInteger> Cyclic.cyclicPoly
(GenPolynomialRing<BigInteger> ring, int n, int i) (package private) List
<GenPolynomial<BigInteger>> Cyclic.cyclicPolys
(GenPolynomialRing<BigInteger> ring) Compute list of polynomials. -
Uses of BigInteger in edu.jas.gbufd
Fields in edu.jas.gbufd with type parameters of type BigIntegerMethods in edu.jas.gbufd that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.Methods in edu.jas.gbufd with parameters of type BigIntegerModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.Method parameters in edu.jas.gbufd with type arguments of type BigIntegerModifier and TypeMethodDescriptionstatic GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.static GroebnerBaseAbstract
<BigInteger> GBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.SGBFactory.getImplementation
(BigInteger fac, GBFactory.Algo a, PairList<BigInteger> pl) Determine suitable implementation of GB algorithms, case BigInteger.Constructor parameters in edu.jas.gbufd with type arguments of type BigIntegerModifierConstructorDescriptionGroebnerBaseRational
(int threads, PairList<BigInteger> pl) Constructor.Constructor.Constructor. -
Uses of BigInteger in edu.jas.poly
Fields in edu.jas.poly with type parameters of type BigIntegerModifier and TypeFieldDescription(package private) GenPolynomialRing
<BigInteger> RatToIntPoly.ring
Methods in edu.jas.poly that return BigIntegerModifier and TypeMethodDescriptionRatNumer.eval
(BigRational c) RatToInt.eval
(BigRational c) RatToIntFactor.eval
(BigRational c) static BigInteger
PolyUtil.factorBound
(ExpVector e) Factor coefficient bound.Methods in edu.jas.poly that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionstatic <C extends RingElem<C>>
List<GenPolynomial<BigInteger>> TermOrderOptimization.degreeMatrix
(GenPolynomial<C> A) Degree matrix.static <C extends RingElem<C>>
List<GenPolynomial<BigInteger>> TermOrderOptimization.degreeMatrix
(Collection<GenPolynomial<C>> L) Degree matrix.static <C extends RingElem<C>>
List<GenPolynomial<BigInteger>> TermOrderOptimization.degreeMatrixOfCoefficients
(GenPolynomial<GenPolynomial<C>> A) Degree matrix of coefficient polynomials.static <C extends RingElem<C>>
List<GenPolynomial<BigInteger>> TermOrderOptimization.degreeMatrixOfCoefficients
(Collection<GenPolynomial<GenPolynomial<C>>> L) Degree matrix of coefficient polynomials.RatToIntPoly.eval
(GenPolynomial<BigRational> c) static List
<GenPolynomial<BigInteger>> TermOrderOptimization.expVectorAdd
(List<GenPolynomial<BigInteger>> dm, ExpVector e) Degree matrix exponent vector add.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficients
(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
List<GenPolynomial<BigInteger>> PolyUtil.integerFromModularCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficientsPositive
(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, positive.static GenPolynomial
<BigInteger> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A) BigInteger from BigRational coefficients.static GenPolynomial
<BigInteger> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, BigInteger gcd, BigInteger lcm, GenPolynomial<BigRational> A) BigInteger from BigRational coefficients.static List
<GenPolynomial<BigInteger>> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<BigRational>> L) BigInteger from BigRational coefficients.Methods in edu.jas.poly with parameters of type BigIntegerModifier and TypeMethodDescriptionFromInteger.eval
(BigInteger c) static Product
<ModInteger> PolyUtil.toProduct
(ProductRing<ModInteger> pfac, BigInteger c) Product representation.Method parameters in edu.jas.poly with type arguments of type BigIntegerModifier and TypeMethodDescriptionFromIntegerPoly.eval
(GenPolynomial<BigInteger> c) static List
<GenPolynomial<BigInteger>> TermOrderOptimization.expVectorAdd
(List<GenPolynomial<BigInteger>> dm, ExpVector e) Degree matrix exponent vector add.static <C extends RingElem<C>>
GenPolynomial<C> PolyUtil.fromIntegerCoefficients
(GenPolynomialRing<C> fac, GenPolynomial<BigInteger> A) From BigInteger coefficients.static <C extends RingElem<C>>
List<GenPolynomial<C>> PolyUtil.fromIntegerCoefficients
(GenPolynomialRing<C> fac, List<GenPolynomial<BigInteger>> L) From BigInteger coefficients.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficients
(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
List<GenPolynomial<BigInteger>> PolyUtil.integerFromModularCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<C>> L) BigInteger from ModInteger coefficients, symmetric.static <C extends RingElem<C> & Modular>
GenPolynomial<BigInteger> PolyUtil.integerFromModularCoefficientsPositive
(GenPolynomialRing<BigInteger> fac, GenPolynomial<C> A) BigInteger from ModInteger coefficients, positive.static GenPolynomial
<BigInteger> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A) BigInteger from BigRational coefficients.static GenPolynomial
<BigInteger> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, BigInteger gcd, BigInteger lcm, GenPolynomial<BigRational> A) BigInteger from BigRational coefficients.static List
<GenPolynomial<BigInteger>> PolyUtil.integerFromRationalCoefficients
(GenPolynomialRing<BigInteger> fac, List<GenPolynomial<BigRational>> L) BigInteger from BigRational coefficients.static Object[]
PolyUtil.integerFromRationalCoefficientsFactor
(GenPolynomialRing<BigInteger> fac, GenPolynomial<BigRational> A) BigInteger from BigRational coefficients.TermOrderOptimization.optimalPermutation
(List<GenPolynomial<BigInteger>> D) Optimal permutation for the Degree matrix.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.Constructor parameters in edu.jas.poly with type arguments of type BigInteger -
Uses of BigInteger in edu.jas.ps
Methods in edu.jas.ps that return types with arguments of type BigIntegerModifier and TypeMethodDescription(package private) static UnivPowerSeries
<BigInteger> Examples.integersFrom
(int start) -
Uses of BigInteger in edu.jas.root
Methods in edu.jas.root that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionstatic List
<BigInteger> RealArithUtil.continuedFraction
(RealAlgebraicNumber<BigRational> A, int M) Continued fraction.Method parameters in edu.jas.root with type arguments of type BigIntegerModifier and TypeMethodDescriptionstatic BigRational
RealArithUtil.continuedFractionApprox
(List<BigInteger> A) Continued fraction approximation. -
Uses of BigInteger in edu.jas.ufd
Fields in edu.jas.ufd with type parameters of type BigIntegerModifier and TypeFieldDescriptionfinal GenPolynomial
<BigInteger> HenselApprox.A
Approximated polynomial with integer coefficients.final GenPolynomial
<BigInteger> HenselApprox.B
Approximated polynomial with integer coefficients.final List
<BigInteger> TrialParts.evalPoints
evaluation pointsprotected final FactorAbstract
<BigInteger> FactorRational.iengine
Factorization engine for integer base coefficients.GreatestCommonDivisorHensel.iufd
Fall back gcd algorithm.protected final GreatestCommonDivisorAbstract
<BigInteger> GreatestCommonDivisorModular.iufd
final List
<BigInteger> TrialParts.ldcfEval
evaluated factors of leading coefficient factors by evaluation pointsfinal List
<GenPolynomial<BigInteger>> TrialParts.ldcfFactors
irreducible factors of leading coefficientprivate final GreatestCommonDivisorAbstract
<BigInteger> GreatestCommonDivisorHensel.ufd
final List
<GenPolynomial<BigInteger>> TrialParts.univFactors
irreducible factors of univariate polynomialfinal GenPolynomial
<BigInteger> TrialParts.univPoly
univariate polynomialMethods in edu.jas.ufd that return BigIntegerModifier and TypeMethodDescriptionHenselApprox.approximationSize()
Get modul of modular polynomial.Methods in edu.jas.ufd that return types with arguments of type BigIntegerModifier and TypeMethodDescriptionFactorInteger.baseFactorsSquarefree
(GenPolynomial<BigInteger> P) GenPolynomial base factorization of a squarefree polynomial.GreatestCommonDivisorHensel.baseGcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial greatest common divisor.GreatestCommonDivisorModular.baseGcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial greatest common divisor.GreatestCommonDivisorModular.baseResultant
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial resultant.static List
<GenPolynomial<BigInteger>> CycloUtil.cyclotomicDecompose
(GenPolynomialRing<BigInteger> ring, long n) Compute the factors of the n-th cyclotomic polynomial.static List
<GenPolynomial<BigInteger>> CycloUtil.cyclotomicFactors
(GenPolynomial<BigInteger> p) Compute the factors of the cyclotomic polynomial.static GenPolynomial
<BigInteger> CycloUtil.cyclotomicPolynomial
(GenPolynomialRing<BigInteger> ring, long n) Compute n-th cyclotomic polynomial.FactorInteger.factorsSquarefree
(GenPolynomial<BigInteger> P) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.FactorInteger.factorsSquarefreeHensel
(GenPolynomial<BigInteger> P) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.FactorInteger.factorsSquarefreeOptions
(GenPolynomial<BigInteger> P, boolean opti, boolean tlex) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.GreatestCommonDivisorModular.gcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) GenPolynomial greatest common divisor, modular algorithm.static FactorAbstract
<BigInteger> FactorFactory.getImplementation
(BigInteger fac) Determine suitable implementation of factorization algorithm, case BigInteger.GCDFactory.getImplementation
(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.static SquarefreeAbstract
<BigInteger> SquarefreeFactory.getImplementation
(BigInteger fac) Determine suitable implementation of squarefree factorization algorithm, case BigInteger.GCDFactory.getProxy
(BigInteger fac) Determine suitable procy for gcd algorithms, case BigInteger.static GenPolynomial
<GenPolynomial<BigInteger>> PolyUfdUtil.integerFromRationalCoefficients
(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A) BigInteger from BigRational coefficients.static List
<GenPolynomial<GenPolynomial<BigInteger>>> PolyUfdUtil.integerFromRationalCoefficients
(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L) BigInteger from BigRational coefficients.GreatestCommonDivisorHensel.recursiveUnivariateGcd
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive greatest common divisor.GreatestCommonDivisorModular.recursiveUnivariateGcd
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive greatest common divisor.GreatestCommonDivisorModular.recursiveUnivariateResultant
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive resultant.GreatestCommonDivisorModular.resultant
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) GenPolynomial resultant, modular algorithm.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsNonMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.Methods in edu.jas.ufd with parameters of type BigIntegerModifier and TypeMethodDescriptionstatic FactorAbstract
<BigInteger> FactorFactory.getImplementation
(BigInteger fac) Determine suitable implementation of factorization algorithm, case BigInteger.GCDFactory.getImplementation
(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.static SquarefreeAbstract
<BigInteger> SquarefreeFactory.getImplementation
(BigInteger fac) Determine suitable implementation of squarefree factorization algorithm, case BigInteger.GCDFactory.getProxy
(BigInteger fac) Determine suitable procy for gcd algorithms, case BigInteger.static boolean
HenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, GenPolynomial<BigInteger> A, GenPolynomial<BigInteger> B) Modular Hensel lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, HenselApprox<MOD> Ha) Modular Hensel lifting test.static boolean
HenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, List<GenPolynomial<BigInteger>> G) Modular Hensel lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsNonMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.(package private) boolean
FactorInteger.testSeparate
(List<BigInteger> A, BigInteger b) Test if b has a prime factor different to the elements of A.Method parameters in edu.jas.ufd with type arguments of type BigIntegerModifier and TypeMethodDescriptionFactorInteger.baseFactorsSquarefree
(GenPolynomial<BigInteger> P) GenPolynomial base factorization of a squarefree polynomial.GreatestCommonDivisorHensel.baseGcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial greatest common divisor.GreatestCommonDivisorModular.baseGcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial greatest common divisor.GreatestCommonDivisorModular.baseResultant
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) Univariate GenPolynomial resultant.static List
<GenPolynomial<BigInteger>> CycloUtil.cyclotomicDecompose
(GenPolynomialRing<BigInteger> ring, long n) Compute the factors of the n-th cyclotomic polynomial.static List
<GenPolynomial<BigInteger>> CycloUtil.cyclotomicFactors
(GenPolynomial<BigInteger> p) Compute the factors of the cyclotomic polynomial.static GenPolynomial
<BigInteger> CycloUtil.cyclotomicPolynomial
(GenPolynomialRing<BigInteger> ring, long n) Compute n-th cyclotomic polynomial.FactorInteger.factorsSquarefree
(GenPolynomial<BigInteger> P) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.FactorInteger.factorsSquarefreeHensel
(GenPolynomial<BigInteger> P) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.FactorInteger.factorsSquarefreeOptions
(GenPolynomial<BigInteger> P, boolean opti, boolean tlex) GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.static <C extends RingElem<C>>
GenPolynomial<GenPolynomial<C>> PolyUfdUtil.fromIntegerCoefficients
(GenPolynomialRing<GenPolynomial<C>> fac, GenPolynomial<GenPolynomial<BigInteger>> A) From BigInteger coefficients.static <C extends RingElem<C>>
List<GenPolynomial<GenPolynomial<C>>> PolyUfdUtil.fromIntegerCoefficients
(GenPolynomialRing<GenPolynomial<C>> fac, List<GenPolynomial<GenPolynomial<BigInteger>>> L) From BigInteger coefficients.GreatestCommonDivisorModular.gcd
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) GenPolynomial greatest common divisor, modular algorithm.static GenPolynomial
<GenPolynomial<BigInteger>> PolyUfdUtil.integerFromRationalCoefficients
(GenPolynomialRing<GenPolynomial<BigInteger>> fac, GenPolynomial<GenPolynomial<BigRational>> A) BigInteger from BigRational coefficients.static List
<GenPolynomial<GenPolynomial<BigInteger>>> PolyUfdUtil.integerFromRationalCoefficients
(GenPolynomialRing<GenPolynomial<BigInteger>> fac, List<GenPolynomial<GenPolynomial<BigRational>>> L) BigInteger from BigRational coefficients.static boolean
CycloUtil.isCyclotomicPolynomial
(GenPolynomial<BigInteger> p) Test for cyclotomic polynomial.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselMultUtil.isHenselLift
(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<GenPolynomial<MOD>> L) Modular Hensel lifting algorithm on coefficients test.static boolean
HenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, GenPolynomial<BigInteger> A, GenPolynomial<BigInteger> B) Modular Hensel lifting test.static <MOD extends GcdRingElem<MOD> & Modular>
booleanHenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, HenselApprox<MOD> Ha) Modular Hensel lifting test.static boolean
HenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, List<GenPolynomial<BigInteger>> G) Modular Hensel lifting test.static boolean
HenselUtil.isHenselLift
(GenPolynomial<BigInteger> C, BigInteger M, BigInteger p, List<GenPolynomial<BigInteger>> G) Modular Hensel lifting test.boolean
FactorInteger.isIrreducible
(GenPolynomial<BigInteger> P) GenPolynomial test if is irreducible.boolean
FactorInteger.isIrreducibleEisenstein
(GenPolynomial<BigInteger> P) GenPolynomial test if is irreducible with Eisenstein criterion.(package private) boolean
FactorInteger.isNearlySquarefree
(GenPolynomial<BigInteger> P) static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHensel
(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G) Modular Hensel lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftHensel
(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k, BigInteger g) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHenselFull
(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k, List<GenPolynomial<BigInteger>> G) Modular Hensel full lifting algorithm.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselMultUtil.liftHenselMonic
(GenPolynomial<BigInteger> C, GenPolynomial<MOD> Cp, List<GenPolynomial<MOD>> F, List<BigInteger> V, long k) Modular Hensel lifting algorithm, monic case.static <MOD extends GcdRingElem<MOD> & Modular>
List<GenPolynomial<MOD>> HenselUtil.liftHenselMonic
(GenPolynomial<BigInteger> C, List<GenPolynomial<MOD>> F, long k) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadratic
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular quadratic Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B) Modular Hensel lifting algorithm on coefficients.static <MOD extends GcdRingElem<MOD> & Modular>
HenselApprox<MOD> HenselUtil.liftHenselQuadraticFac
(GenPolynomial<BigInteger> C, BigInteger M, GenPolynomial<MOD> A, GenPolynomial<MOD> B, GenPolynomial<MOD> S, GenPolynomial<MOD> T) Modular Hensel lifting algorithm on coefficients.GreatestCommonDivisorHensel.recursiveUnivariateGcd
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive greatest common divisor.GreatestCommonDivisorModular.recursiveUnivariateGcd
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive greatest common divisor.GreatestCommonDivisorModular.recursiveUnivariateResultant
(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S) Univariate GenPolynomial recursive resultant.GreatestCommonDivisorModular.resultant
(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S) GenPolynomial resultant, modular algorithm.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.(package private) List
<GenPolynomial<BigInteger>> FactorInteger.searchFactorsNonMonic
(GenPolynomial<BigInteger> C, BigInteger M, List<GenPolynomial<MOD>> F, BitSet D) Factor search with modular Hensel lifting algorithm.(package private) boolean
FactorInteger.testSeparate
(List<BigInteger> A, BigInteger b) Test if b has a prime factor different to the elements of A.Constructor parameters in edu.jas.ufd with type arguments of type BigIntegerModifierConstructorDescriptionFactorInteger
(RingFactory<BigInteger> cfac) Constructor.HenselApprox
(GenPolynomial<BigInteger> A, GenPolynomial<BigInteger> B, GenPolynomial<MOD> Am, GenPolynomial<MOD> Bm) Constructor.TrialParts
(List<BigInteger> ev, GenPolynomial<BigInteger> up, List<GenPolynomial<BigInteger>> uf, List<BigInteger> le, List<GenPolynomial<BigInteger>> lf) Constructor.TrialParts
(List<BigInteger> ev, GenPolynomial<BigInteger> up, List<GenPolynomial<BigInteger>> uf, List<BigInteger> le, List<GenPolynomial<BigInteger>> lf) Constructor.