Uses of Class
edu.jas.arith.BigInteger

Packages that use BigInteger

Package	Description
edu.jas.application	Groebner base application package.
edu.jas.arith	Basic arithmetic package.
edu.jas.fd	Factorization domain package for solvable polynomial rings.
edu.jas.gb	Groebner bases package.
edu.jas.gbufd	Groebner bases using unique factorization package.
edu.jas.poly	Generic coefficients polynomial package.
edu.jas.ps	Generic coefficients power series package.
edu.jas.root	Real and Complex Root Computation package.
edu.jas.ufd	Unique factorization domain package.

Uses of BigInteger in edu.jas.application

Fields in edu.jas.application with type parameters of type BigInteger

Modifier and Type	Field	Description
(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

Classes in edu.jas.arith that implement interfaces with type arguments of type BigInteger

Modifier and Type	Class	Description
final class	BigInteger	BigInteger class to make java.math.BigInteger available with RingElem respectively the GcdRingElem interface.
final class	BigInteger	BigInteger class to make java.math.BigInteger available with RingElem respectively the GcdRingElem interface.
final class	BigInteger	BigInteger class to make java.math.BigInteger available with RingElem respectively the GcdRingElem interface.
(package private) class	BigIntegerIterator	Big integer iterator.

Fields in edu.jas.arith declared as BigInteger

Modifier and Type	Field	Description
(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 BigInteger

Modifier and Type	Field	Description
(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 BigInteger

Modifier and Type	Method	Description
BigInteger	BigInteger.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	BigInteger.copy()	Clone this.
BigInteger	BigInteger.copy(BigInteger c)	Copy BigInteger element c.
BigInteger	BigInteger.divide(BigInteger S)	BigInteger divide.
BigInteger[]	BigInteger.egcd(BigInteger S)	BigInteger extended greatest common divisor.
static BigInteger	Combinatoric.factorial(long n)	Factorial.
BigInteger	BigInteger.factory()	Get the corresponding element factory.
BigInteger	BigInteger.fromInteger(long a)	Get a BigInteger element from long.
BigInteger	BigInteger.fromInteger(BigInteger a)	Get a BigInteger element from a math.BigInteger.
BigInteger	BigInteger.gcd(BigInteger S)	BigInteger greatest common divisor.
BigInteger	ModInt.getInteger()	Return a BigInteger from this Element.
BigInteger	ModInteger.getInteger()	Return a BigInteger from this Element.
BigInteger	ModLong.getInteger()	Return a BigInteger from this Element.
BigInteger	Modular.getInteger()	Return a BigInteger from this Element.
BigInteger	ModIntegerRing.getIntegerModul()	Get the module part as BigInteger.
BigInteger	ModIntRing.getIntegerModul()	Get the module part as BigInteger.
BigInteger	ModLongRing.getIntegerModul()	Get the module part as BigInteger.
BigInteger	ModularRingFactory.getIntegerModul()	Return the BigInteger modul for the factory.
BigInteger	BigInteger.getONE()	Get the one element.
BigInteger	ModInt.getSymmetricInteger()	Return a symmetric BigInteger from this Element.
BigInteger	ModInteger.getSymmetricInteger()	Return a symmetric BigInteger from this Element.
BigInteger	ModLong.getSymmetricInteger()	Return a symmetric BigInteger from this Element.
BigInteger	Modular.getSymmetricInteger()	Return a symmetric BigInteger from this Element.
BigInteger	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	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	BigInteger.multiply(BigInteger S)	BigInteger multiply.
BigInteger	BigInteger.negate()
BigInteger	BigIntegerIterator.next()	Get next integer.
BigInteger	BigInteger.parse(Reader r)	BigInteger parse from Reader.
BigInteger	BigInteger.parse(String s)	BigInteger parse from String.
BigInteger[]	BigInteger.quotientRemainder(BigInteger S)	BigInteger compute quotient and remainder.
BigInteger	BigInteger.random(int n)	BigInteger random.
BigInteger	BigInteger.random(int n, Random rnd)	BigInteger random.
BigInteger	BigInteger.remainder(BigInteger S)	BigInteger remainder.
static BigInteger	Roots.root(BigInteger A, int n)	Integer n-th root.
BigInteger	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	BigInteger.subtract(BigInteger S)	BigInteger subtract.
BigInteger	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 BigInteger

Modifier and Type	Method	Description
static List<BigInteger>	ArithUtil.continuedFraction(BigRational A)	Continued fraction.
List<BigInteger>	BigInteger.generators()	Get a list of the generating elements.
Iterator<BigInteger>	BigInteger.iterator()	Get a BigInteger iterator.

Methods in edu.jas.arith with parameters of type BigInteger

Modifier and Type	Method	Description
static BigInteger	Combinatoric.binCoeffInduction(BigInteger A, long n, long k)	Integer binomial coefficient induction.
int	BigInteger.compareTo(BigInteger b)	Compare to BigInteger b.
BigInteger	BigInteger.copy(BigInteger c)	Copy BigInteger element c.
BigInteger	BigInteger.divide(BigInteger S)	BigInteger divide.
BigInteger[]	BigInteger.egcd(BigInteger S)	BigInteger extended greatest common divisor.
BigRational	BigRational.fromInteger(BigInteger a)	Get a BigRational element from a arith.BigInteger.
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	BigInteger.multiply(BigInteger S)	BigInteger multiply.
BigInteger[]	BigInteger.quotientRemainder(BigInteger S)	BigInteger compute quotient and remainder.
BigInteger	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	BigInteger.subtract(BigInteger S)	BigInteger subtract.
BigInteger	BigInteger.sum(BigInteger S)	BigInteger summation.

Method parameters in edu.jas.arith with type arguments of type BigInteger

Modifier and Type	Method	Description
static BigRational	ArithUtil.continuedFractionApprox(List<BigInteger> A)	Continued fraction approximation.

Constructors in edu.jas.arith with parameters of type BigInteger

Modifier	Constructor	Description
	BigRational(BigInteger n)	Constructor 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 BigInteger

Modifier and Type	Method	Description
static GreatestCommonDivisorAbstract<BigInteger>	SGCDFactory.getImplementation(BigInteger fac)	Determine suitable implementation of gcd algorithms, case BigInteger.
static GreatestCommonDivisorAbstract<BigInteger>	SGCDFactory.getProxy(BigInteger fac)	Determine suitable proxy for gcd algorithms, case BigInteger.

Methods in edu.jas.fd with parameters of type BigInteger

Modifier and Type	Method	Description
static GreatestCommonDivisorAbstract<BigInteger>	SGCDFactory.getImplementation(BigInteger fac)	Determine suitable implementation of gcd algorithms, case BigInteger.
static GreatestCommonDivisorAbstract<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 BigInteger

Modifier and Type	Field	Description
final GenPolynomialRing<BigInteger>	Cyclic.ring

Methods in edu.jas.gb that return types with arguments of type BigInteger

Modifier and Type	Method	Description
(package private) GenPolynomial<BigInteger>	Cyclic.cyclicPoly(GenPolynomialRing<BigInteger> ring, int n, int i)
List<GenPolynomial<BigInteger>>	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 BigInteger

Modifier and Type	Method	Description
(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 BigInteger

Modifier and Type	Field	Description
final GroebnerBaseAbstract<BigInteger>	GroebnerBaseRational.bba

Methods in edu.jas.gbufd that return types with arguments of type BigInteger

Modifier and Type	Method	Description
static 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.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<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 BigInteger

Modifier and Type	Method	Description
static 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.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, GBFactory.Algo a)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<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 BigInteger

Modifier and Type	Method	Description
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, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<BigInteger>	SGBFactory.getImplementation(BigInteger fac, PairList<BigInteger> pl)	Determine suitable implementation of GB algorithms, case BigInteger.
static SolvableGroebnerBaseAbstract<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 BigInteger

Modifier	Constructor	Description
	GroebnerBaseRational(int threads, PairList<BigInteger> pl)	Constructor.
	GroebnerBaseRational(GroebnerBaseAbstract<BigInteger> bba)	Constructor.
	GroebnerBaseRational(PairList<BigInteger> pl)	Constructor.

Uses of BigInteger in edu.jas.poly

Classes in edu.jas.poly that implement interfaces with type arguments of type BigInteger

Modifier and Type	Class	Description
(package private) class	FromInteger<D extends RingElem<D>>	Conversion from BigInteger functor.
(package private) class	FromIntegerPoly<D extends RingElem<D>>	Conversion from GenPolynomial functor.
(package private) class	ModSymToInt<C extends RingElem<C> & Modular>	Conversion of symmetric ModInteger to BigInteger functor.
(package private) class	ModToInt<C extends RingElem<C> & Modular>	Conversion of ModInteger to BigInteger functor.
(package private) class	RatNumer	BigRational numerator functor.
(package private) class	RatToInt	Conversion of BigRational to BigInteger with division by lcm functor.
(package private) class	RatToIntFactor	Conversion of BigRational to BigInteger.
(package private) class	RatToIntPoly	Conversion from GenPolynomial to GenPolynomial functor.

Fields in edu.jas.poly with type parameters of type BigInteger

Modifier and Type	Field	Description
(package private) GenPolynomialRing<BigInteger>	RatToIntPoly.ring

Methods in edu.jas.poly that return BigInteger

Modifier and Type	Method	Description
BigInteger	ModSymToInt.eval(C c)
BigInteger	ModToInt.eval(C c)
BigInteger	RatNumer.eval(BigRational c)
BigInteger	RatToInt.eval(BigRational c)
BigInteger	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 BigInteger

Modifier and Type	Method	Description
static <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.
GenPolynomial<BigInteger>	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 BigInteger

Modifier and Type	Method	Description
D	FromInteger.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 BigInteger

Modifier and Type	Method	Description
GenPolynomial<D>	FromIntegerPoly.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.
static List<Integer>	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

Modifier	Constructor	Description
	RatToIntPoly(GenPolynomialRing<BigInteger> ring)

Uses of BigInteger in edu.jas.ps

Methods in edu.jas.ps that return types with arguments of type BigInteger

Modifier and Type	Method	Description
(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 BigInteger

Modifier and Type	Method	Description
static List<BigInteger>	RealArithUtil.continuedFraction(RealAlgebraicNumber<BigRational> A, int M)	Continued fraction.

Method parameters in edu.jas.root with type arguments of type BigInteger

Modifier and Type	Method	Description
static BigRational	RealArithUtil.continuedFractionApprox(List<BigInteger> A)	Continued fraction approximation.

Uses of BigInteger in edu.jas.ufd

Subclasses with type arguments of type BigInteger in edu.jas.ufd

Modifier and Type	Class	Description
class	FactorInteger<MOD extends GcdRingElem<MOD> & Modular>	Integer coefficients factorization algorithms.
class	GreatestCommonDivisorHensel<MOD extends GcdRingElem<MOD> & Modular>	Greatest common divisor algorithms with subresultant polynomial remainder sequence and univariate Hensel lifting.
class	GreatestCommonDivisorModular<MOD extends GcdRingElem<MOD> & Modular>	Greatest common divisor algorithms with modular computation and Chinese remainder algorithm.

Fields in edu.jas.ufd with type parameters of type BigInteger

Modifier and Type	Field	Description
final 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 points
protected final FactorAbstract<BigInteger>	FactorRational.iengine	Factorization engine for integer base coefficients.
final GreatestCommonDivisorAbstract<BigInteger>	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 points
final List<GenPolynomial<BigInteger>>	TrialParts.ldcfFactors	irreducible factors of leading coefficient
private final GreatestCommonDivisorAbstract<BigInteger>	GreatestCommonDivisorHensel.ufd
final List<GenPolynomial<BigInteger>>	TrialParts.univFactors	irreducible factors of univariate polynomial
final GenPolynomial<BigInteger>	TrialParts.univPoly	univariate polynomial

Methods in edu.jas.ufd that return BigInteger

Modifier and Type	Method	Description
BigInteger	HenselApprox.approximationSize()	Get modul of modular polynomial.

Methods in edu.jas.ufd that return types with arguments of type BigInteger

Modifier and Type	Method	Description
List<GenPolynomial<BigInteger>>	FactorInteger.baseFactorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial base factorization of a squarefree polynomial.
GenPolynomial<BigInteger>	GreatestCommonDivisorHensel.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	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.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeHensel(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeOptions(GenPolynomial<BigInteger> P, boolean opti, boolean tlex)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
GenPolynomial<BigInteger>	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.
static GreatestCommonDivisorAbstract<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.
static GreatestCommonDivisorAbstract<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.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<BigInteger>	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 BigInteger

Modifier and Type	Method	Description
static FactorAbstract<BigInteger>	FactorFactory.getImplementation(BigInteger fac)	Determine suitable implementation of factorization algorithm, case BigInteger.
static GreatestCommonDivisorAbstract<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.
static GreatestCommonDivisorAbstract<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> boolean	HenselUtil.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 BigInteger

Modifier and Type	Method	Description
List<GenPolynomial<BigInteger>>	FactorInteger.baseFactorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial base factorization of a squarefree polynomial.
GenPolynomial<BigInteger>	GreatestCommonDivisorHensel.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	GreatestCommonDivisorModular.baseGcd(GenPolynomial<BigInteger> P, GenPolynomial<BigInteger> S)	Univariate GenPolynomial greatest common divisor.
GenPolynomial<BigInteger>	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.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefree(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting if possible.
List<GenPolynomial<BigInteger>>	FactorInteger.factorsSquarefreeHensel(GenPolynomial<BigInteger> P)	GenPolynomial factorization of a multivariate squarefree polynomial, using Hensel lifting.
List<GenPolynomial<BigInteger>>	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.
GenPolynomial<BigInteger>	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> boolean	HenselMultUtil.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> boolean	HenselUtil.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.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorHensel.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateGcd(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive greatest common divisor.
GenPolynomial<GenPolynomial<BigInteger>>	GreatestCommonDivisorModular.recursiveUnivariateResultant(GenPolynomial<GenPolynomial<BigInteger>> P, GenPolynomial<GenPolynomial<BigInteger>> S)	Univariate GenPolynomial recursive resultant.
GenPolynomial<BigInteger>	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 BigInteger

Modifier	Constructor	Description
	FactorInteger(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.