A B C D E F G H I J K L M N O P Q R S T U V W X Z
All Classes All Packages
All Classes All Packages
A
- a - Variable in class de.tilman_neumann.jml.gcd.EEA31.Result
-
if g==1 then a = (1/x) mod y
- a - Variable in class de.tilman_neumann.jml.gcd.EEA63.Result
-
if g==1 then a = (1/x) mod y
- abs() - Method in class de.tilman_neumann.jml.base.BigRational
- absStirling1(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
-
Absolute Stirling numbers of the first kind.
- absSum(Collection<BigInteger>) - Static method in class de.tilman_neumann.jml.base.BigIntCollectionUtil
- accessStats() - Method in class de.tilman_neumann.jml.partitions.MpiPowerMap
- acosh1(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.hyperbolic.ArcCosH
-
Computes the "++" branch of acosh(x) = + ln(x + sqrt(x^2-1)).
- acoshAbs(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.hyperbolic.ArcCosH
-
The absolute value of acosh(x) implemented by ln() formula.
- acoth(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.hyperbolic.ArcCotH
-
acoth(x) implemented by ln() formula.
- add(int) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
-
Add a single element x to this index set.
- add(int) - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
-
Add a factor.
- add(int) - Method in class de.tilman_neumann.jml.precision.Precision
- add(int) - Method in class de.tilman_neumann.jml.precision.Scale
- add(int, short) - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
-
Add a factor to the given power.
- add(long) - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
-
Add a factor.
- add(BigRational) - Method in class de.tilman_neumann.jml.base.BigRational
-
Computes the sum of this and the argument.
- add(Uint128) - Method in class de.tilman_neumann.jml.base.Uint128
-
Add two unsigned 128 bit integers.
- add(AQPair) - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
-
Add a new elementary partial or smooth congruence.
- add(PolyReport) - Method in class de.tilman_neumann.jml.factor.siqs.poly.PolyReport
-
Add two reports.
- add(SieveReport) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SieveReport
-
Add two reports.
- add(TDivReport) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
-
Add two reports.
- add(BigDecimal, BigRational, Scale) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Computes the sum of a and b accurate to the given resultScale.
Scale is the natural accuracy measure for additions because for each argument, each piece of it (bit, digit, ...) makes its own independent contribution to the result scale. - add(BigDecimal, BigInteger) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
- add(List<U>) - Method in class de.tilman_neumann.jml.base.NumberGrid
-
Adds a new row of numbers to this grid.
- add(T) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- add(T) - Method in class de.tilman_neumann.util.SortedList
-
Insert the new object at the position given by the Comparator.
- add(T, int) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- add_getHigh(Uint128) - Method in class de.tilman_neumann.jml.base.Uint128
-
Compute the sum of this and other, return the high part.
- add_v1(Uint128) - Method in class de.tilman_neumann.jml.base.Uint128
-
Add two unsigned 128 bit integers.
- addAll(Collection<? extends T>) - Method in class de.tilman_neumann.util.SortedList
-
Insert the new objects at the position given by the Comparator.
- addAll(Collection<T>) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- addAll(Multiset<T>) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- addAll(T[]) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- addMyAQPairsViaXor(Set<AQPair>) - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- addMyAQPairsViaXor(Set<AQPair>) - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Simple
- addMyAQPairsViaXor(Set<AQPair>) - Method in interface de.tilman_neumann.jml.factor.base.congruence.Smooth
-
Add
this
's AQPairs to the target set via xor. - addPowers(BigInteger, int[], int[], byte[], double[], long[], int, SieveParams) - Method in class de.tilman_neumann.jml.factor.siqs.powers.NoPowerFinder
- addPowers(BigInteger, int[], int[], byte[], double[], long[], int, SieveParams) - Method in interface de.tilman_neumann.jml.factor.siqs.powers.PowerFinder
-
Find powers and add them to the prime base.
- addPowers(BigInteger, int[], int[], byte[], double[], long[], int, SieveParams) - Method in class de.tilman_neumann.jml.factor.siqs.powers.SomePowerFinder
- addRow(ArrayList<BigInteger>) - Method in class de.tilman_neumann.jml.base.BigIntTriangle
- addSmooth(Smooth) - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
-
Add smooth congruence.
- addXor(IndexSet) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- addXor(MatrixRow) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
-
Combine this and other in Z_2, modifying this.
- agm(BigDecimal, BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.transcendental.Agm
-
Arithmetic-geometric mean of a and b.
- Agm - Class in de.tilman_neumann.jml.transcendental
- Agm() - Constructor for class de.tilman_neumann.jml.transcendental.Agm
- allocateMemory(long) - Static method in class de.tilman_neumann.jml.factor.base.UnsafeUtil
-
Allocate a native memory block.
- AllPowerFinder - Class in de.tilman_neumann.jml.factor.siqs.powers
-
Algorithm that finds all powers in [pMin, pMax].
- AllPowerFinder() - Constructor for class de.tilman_neumann.jml.factor.siqs.powers.AllPowerFinder
- AnalysisOptions - Interface in de.tilman_neumann.jml.factor.base
-
Factoring analysis settings.
- ANALYZE - Static variable in interface de.tilman_neumann.jml.factor.base.AnalysisOptions
-
Basic analysis includes number of polynomials, number of smooth and partial relations (also by large factor counts), trials division results, solver runs and tested null-vectors, and sub-phase timings.
- ANALYZE - Static variable in interface de.tilman_neumann.jml.factor.base.GlobalFactoringOptions
-
Basic analysis of timings and operations.
- ANALYZE_LARGE_FACTOR_SIZES - Static variable in interface de.tilman_neumann.jml.factor.base.AnalysisOptions
-
A switch to additionally turn on analysis of the size of large factors that yield smooth relations.
- ANALYZE_LARGE_FACTOR_SIZES - Static variable in interface de.tilman_neumann.jml.factor.base.GlobalFactoringOptions
-
A switch to additionally turn on analysis of the size of large factors that yield smooth relations.
- ANALYZE_Q_SIGNS - Static variable in interface de.tilman_neumann.jml.factor.base.AnalysisOptions
-
A switch to additionally turn on analysis of the number of Q-values with positive and negative sign.
- ANALYZE_Q_SIGNS - Static variable in interface de.tilman_neumann.jml.factor.base.GlobalFactoringOptions
-
A switch to additionally turn on analysis of the number of Q-values with positive and negative sign.
- and(long) - Method in class de.tilman_neumann.jml.base.Uint128
-
Bitwise "and" operation with a long.
- AParamGenerator - Interface in de.tilman_neumann.jml.factor.siqs.poly
-
Interface for generators that produce the leading coefficient
a
of the quadratic polynomial Q(x) = (d*a*x+b)^2 - kN used by SIQS. - AParamGenerator01 - Class in de.tilman_neumann.jml.factor.siqs.poly
-
Generator for the a-parameter (or "hypercube"), which is the leading coefficient of the quadratic polynomial Q(x) = (d*a*x+b)^2 - kN used by SIQS.
- AParamGenerator01(Integer) - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
-
Full constructor.
- apg - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- applyTo(BigDecimal) - Method in class de.tilman_neumann.jml.precision.Precision
-
Reduces the relative precision of x to this, or leaves it as it is if x already has a smaller precision.
- applyTo(BigDecimal) - Method in class de.tilman_neumann.jml.precision.Scale
- AQPair - Class in de.tilman_neumann.jml.factor.base.congruence
-
An elementary smooth or partially smooth congruence A^2 == Q (mod N).
- AQPair(BigInteger, SortedIntegerArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.AQPair
-
Full constructor.
- AQPairFactory - Class in de.tilman_neumann.jml.factor.base.congruence
-
Creates an elementary congruence of the subclass appropriate for the given large factors.
- AQPairFactory() - Constructor for class de.tilman_neumann.jml.factor.base.congruence.AQPairFactory
- ArcCosH - Class in de.tilman_neumann.jml.hyperbolic
-
Inverse hyperbolic cosinus function.
- ArcCosH() - Constructor for class de.tilman_neumann.jml.hyperbolic.ArcCosH
- ArcCotH - Class in de.tilman_neumann.jml.hyperbolic
-
Inverse hyperbolic cotangens function.
- ArcCotH() - Constructor for class de.tilman_neumann.jml.hyperbolic.ArcCotH
- ArcSinH - Class in de.tilman_neumann.jml.hyperbolic
-
Inverse hyperbolic sinus function.
- ArcSinH() - Constructor for class de.tilman_neumann.jml.hyperbolic.ArcSinH
- ArcTanH - Class in de.tilman_neumann.jml.hyperbolic
-
Inverse hyperbolic tangens function.
- ArcTanH() - Constructor for class de.tilman_neumann.jml.hyperbolic.ArcTanH
- array - Variable in class de.tilman_neumann.jml.primes.exact.CollectingCallback
- ASCENDING - de.tilman_neumann.util.SortOrder
-
Ascending order.
- asinh(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.hyperbolic.ArcSinH
-
y = asinh(x) implemented by ln() formula, for all real x.
- at(int) - Method in class de.tilman_neumann.jml.base.BigIntPoly
-
Retrieve a polynomial coefficient.
- atanh(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.hyperbolic.ArcTanH
-
atanh(x) implemented by ln() formula.
- AutoExpandingPrimesArray - Class in de.tilman_neumann.jml.primes.exact
-
An auto-expanding facade for the segmented sieve of Eratosthenes.
- AutoExpandingPrimesArray() - Constructor for class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
- auxFactorizer - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- Axler_1_1(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Theorem 1.1: pi(x) < x/ln(x) + x/ln^2(x) + 2*x/ln^3(x) + 6.35*x/ln^4(x) + 24.35*x/ln^5(x) + 121.75*x/ln^6(x) + 730.5*x(ln^7(x) + 6801.4*x/ln^8(x) for x>1.
- Axler_1_3(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Theorem 1.3: pi(x) < x / [ln(x) - 1 - 1/ln(x) - 3.35/ln^2(x) - 12.65/ln^3(x) - 71.7/ln^4(x) - 466.1275/ln^5(x) - 3489.8225/ln^6(x)], for x > e^3.804.
- Axler_3_5a(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Corollary 3.5a: pi(x) < x / [ln(x) - 1 - 1/ln(x) - 3.35/ln^2(x) - 12.65/ln^3(x) - 89.6/ln^4(x)] for x >= 21.95.
- Axler_3_5b(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Corollary 3.5b: pi(x) < x / [ln(x) - 1 - 1/ln(x) - 3.35/ln^2(x) - 15.43/ln^3(x)] for x >= 14.36.
- Axler_3_5c(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Corollary 3.5c: pi(x) < x / [ln(x) - 1 - 1/ln(x) - 3.83/ln^2(x)] for x >= 9.25.
- Axler_3_5d(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Axler, https://arxiv.org/pdf/1409.1780.pdf, Corollary 3.5d: pi(x) < x / [ln(x) - 1 - 1.17/ln(x)]
Works for x >= 2.634.800.823 and then it is the best bound for x < 6.200.000.000 approximately. - Axler2013(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Axler 2013 page viii Korollar G for n >= 8009824.
B
- b - Variable in class de.tilman_neumann.jml.gcd.EEA31.Result
-
if g==1 then b = (1/y) mod x
- b - Variable in class de.tilman_neumann.jml.gcd.EEA63.Result
-
if g==1 then b = (1/y) mod x
- base - Variable in class de.tilman_neumann.jml.powers.PurePowerTest.Result
- BaseArrays - Class in de.tilman_neumann.jml.factor.siqs.data
-
Passive data structure bundling primes/powers, modular sqrts and logP-values.
- BaseArrays(int) - Constructor for class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
Constructor allocating all arrays.
- BaseArrays(int[], int[], int[], int[], byte[], double[], long[]) - Constructor for class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
Constructor setting all arrays.
- BaseFilter - Interface in de.tilman_neumann.jml.factor.siqs.poly.baseFilter
-
Interface for the step filtering some elements out off the (prime/power) base.
- BaseFilter_q1 - Class in de.tilman_neumann.jml.factor.siqs.poly.baseFilter
-
BaseFilter that removes the q-values of the a-parameter and their powers from the base to sieve with.
- BaseFilter_q1() - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q1
- BaseFilter_q2 - Class in de.tilman_neumann.jml.factor.siqs.poly.baseFilter
-
Alternative implementation of a BaseFilter that removes the q-values of the a-parameter and their powers from the base to sieve with.
- BaseFilter_q2() - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q2
- BaseFilter_qk - Class in de.tilman_neumann.jml.factor.siqs.poly.baseFilter
-
BaseFilter that removes the q-values of the a-parameter and their powers from the base to sieve with, plus the p that divide k and their powers.
- BaseFilter_qk() - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_qk
- BaseFilter.Result - Class in de.tilman_neumann.jml.factor.siqs.poly.baseFilter
-
Filtering results.
- BatchFactorizer - Class in de.tilman_neumann.jml.factor
-
Factor all entries from a batch file.
- BatchFactorizer() - Constructor for class de.tilman_neumann.jml.factor.BatchFactorizer
- BigDecimalConstants - Class in de.tilman_neumann.jml.base
- BigDecimalConstants() - Constructor for class de.tilman_neumann.jml.base.BigDecimalConstants
- BigDecimalMath - Class in de.tilman_neumann.jml.base
-
Basic BigDecimal arithmetics.
- BigIntCollectionUtil - Class in de.tilman_neumann.jml.base
-
Utility methods for collections of BigIntegers.
- BigIntCollectionUtil() - Constructor for class de.tilman_neumann.jml.base.BigIntCollectionUtil
- BigIntConstants - Class in de.tilman_neumann.jml.base
- BigIntConstants() - Constructor for class de.tilman_neumann.jml.base.BigIntConstants
- BigIntConverter - Class in de.tilman_neumann.jml.base
-
Conversion from doubles to BigInteger with minimal precision loss and no need of slow BigDecimal.
- BigIntConverter() - Constructor for class de.tilman_neumann.jml.base.BigIntConverter
- BigIntegerPrimality - Class in org.matheclipse.gpl.numbertheory
-
Provides primality probabilistic methods for BigInteger numbers
- BigIntegerPrimality() - Constructor for class org.matheclipse.gpl.numbertheory.BigIntegerPrimality
- BigIntGrid - Class in de.tilman_neumann.jml.base
-
A two-dimensional grid of big integers.
- BigIntGrid(String, int, int, String, int, int) - Constructor for class de.tilman_neumann.jml.base.BigIntGrid
-
Full constructor with all options.
- BigIntGrid(String, int, String, int) - Constructor for class de.tilman_neumann.jml.base.BigIntGrid
-
Simplified constructor with offsets 1.
- BigIntPoly - Class in de.tilman_neumann.jml.base
-
A simple integer polynomial implementation, once inspired by http://www.strw.leidenuniv.nl/~mathar/progs/FI/oeis_8java.html (now dead link, sorry)
- BigIntPoly(int) - Constructor for class de.tilman_neumann.jml.base.BigIntPoly
-
Constructor for an empty polynomial with initial capacity n.
- BigIntTriangle - Class in de.tilman_neumann.jml.base
-
A triangle of integers.
- BigIntTriangle() - Constructor for class de.tilman_neumann.jml.base.BigIntTriangle
-
Create a triangle without data.
- BigIntTriangle(int, BigInteger) - Constructor for class de.tilman_neumann.jml.base.BigIntTriangle
-
Creates an initialized number triangle with n rows.
- BigRational - Class in de.tilman_neumann.jml.base
-
Big rational numbers with exact arithmetics.
- BigRational(BigInteger) - Constructor for class de.tilman_neumann.jml.base.BigRational
-
Constructor for an integer.
- BigRational(BigInteger, BigInteger) - Constructor for class de.tilman_neumann.jml.base.BigRational
-
Constructor for a rational number.
- BinarySearch - Class in de.tilman_neumann.jml
-
Binary search in bottom-up sorted integer arrays.
- BinarySearch() - Constructor for class de.tilman_neumann.jml.BinarySearch
- binaryToDecimal(int) - Static method in class de.tilman_neumann.jml.precision.Magnitude
-
Compute the number of decimal digits analogous to the specified number of binary digits.
- binomial(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Binomial
-
Returns the binomial coefficient C(n, k).
- Binomial - Class in de.tilman_neumann.jml.combinatorics
-
Implementation of the binomial coefficient.
- Binomial() - Constructor for class de.tilman_neumann.jml.combinatorics.Binomial
- bitLength() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- bitsOf(BigInteger) - Static method in class de.tilman_neumann.jml.precision.Magnitude
-
Gives the size of absolute |n| in bits: 0 for 0, 1 for +-1, 2 for +-2, 2 for +-3, 3 for +-4, ...
- BlockLanczos - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
Block-Lanczos matrix solver by Dario Alejandro Alpern.
- BlockLanczos() - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.BlockLanczos
- BlockSieveUtil - Class in de.tilman_neumann.jml.factor.siqs.sieve
- BlockSieveUtil() - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.BlockSieveUtil
- BParamTest - Class in de.tilman_neumann.jml.factor.siqs.poly
-
A test of the b-computation numbers reported by [Contini, p.10]
- BParamTest() - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.BParamTest
- BPSWTest - Class in de.tilman_neumann.jml.primes.probable
-
BPSW probable prime test.
- BPSWTest() - Constructor for class de.tilman_neumann.jml.primes.probable.BPSWTest
- Bsqrt(BigInteger) - Static method in class de.tilman_neumann.jml.primes.exact.SSOZJ
- byteValue() - Method in class de.tilman_neumann.jml.base.BigRational
C
- CANEntry - Class in de.tilman_neumann.jml.smooth
-
A colossally abundant number (CAN), together with some information that was necessary to compute it.
- CANIterator - Class in de.tilman_neumann.jml.smooth
-
Iterator for colossally abundant numbers 2,6,12,...
- CANIterator() - Constructor for class de.tilman_neumann.jml.smooth.CANIterator
- capture() - Method in class de.tilman_neumann.util.Timer
- ceilInt() - Method in class de.tilman_neumann.jml.base.BigRational
- ceilInt(BigDecimal) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Returns ceil(x) as a big integer.
- CFrac - Class in de.tilman_neumann.jml.factor.cfrac
-
CFrac = Shanks' SQUFOF algorithm + carry along continuant recurrence + collect smooth relations + LinAlg solver.
The original CFrac was implemented by Morrison&Brillhart intending to factor the 7.th Fermat number F7 with 39 digits (~130 bits). - CFrac(boolean, int, float, float, float, TDiv_CF, int, MatrixSolver, int) - Constructor for class de.tilman_neumann.jml.factor.cfrac.CFrac
-
Standard constructor.
- CFrac63 - Class in de.tilman_neumann.jml.factor.cfrac
-
63 bit CFrac with Knuth-Schroeppel multiplier.
- CFrac63(boolean, int, float, float, float, TDiv_CF63, int, MatrixSolver, int) - Constructor for class de.tilman_neumann.jml.factor.cfrac.CFrac63
-
Standard constructor.
- ChebyshevPolynomials - Class in de.tilman_neumann.jml
-
Computation of values of the Chebyshev polynomials.
- ChebyshevPolynomials() - Constructor for class de.tilman_neumann.jml.ChebyshevPolynomials
- ChebyshevT(int, BigDecimal) - Static method in class de.tilman_neumann.jml.ChebyshevPolynomials
-
Recurrent computation of Chebyshev polynomials of the first kind.
- ChebyshevU(int, BigDecimal) - Static method in class de.tilman_neumann.jml.ChebyshevPolynomials
-
Recurrent computation of Chebyshev polynomials of the second kind.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- cleanUp() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- cleanUp() - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
-
Release memory after a factorization.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.SIQS_Small
-
Clean up after a factorization of N.
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.SIQS
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- cleanUp() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- cleanUp() - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
-
Release memory after a factorization.
- Cmult - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- CollatzSequenceTest - Class in de.tilman_neumann.jml
-
Test Collatz or 3n+1 problem.
- CollatzSequenceTest() - Constructor for class de.tilman_neumann.jml.CollatzSequenceTest
- collectAndProcessAQPairs(List<AQPair>) - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
-
Collect AQ pairs and run the matrix solver if appropriate.
- CollectingCallback - Class in de.tilman_neumann.jml.primes.exact
- CollectingCallback(int) - Constructor for class de.tilman_neumann.jml.primes.exact.CollectingCallback
- CombinedFactorAlgorithm - Class in de.tilman_neumann.jml.factor
-
Final combination of factor algorithms.
- CombinedFactorAlgorithm(int) - Constructor for class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
-
Simple constructor, computing the amount of trial division automatically and using PSIQS with sun.misc.Unsafe features.
- CombinedFactorAlgorithm(int, Integer, boolean) - Constructor for class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
-
Full constructor.
- combinedUpperBound(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Computes an upper bound for p(n) given n.
- combinedUpperBound(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Computes an upper bound for the prime counting function pi(x) := number of primes in (0, x].
- compare(BigDecimal, BigInteger) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
- compareTo(BigRational) - Method in class de.tilman_neumann.jml.base.BigRational
- compareTo(PowerEntry) - Method in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- compareTo(Mpi) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- compareTo(Mpi) - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Compare this with another multipartite integer.
- compareTo(Precision) - Method in class de.tilman_neumann.jml.precision.Precision
- compareTo(Scale) - Method in class de.tilman_neumann.jml.precision.Scale
- compareTo(BigInteger) - Method in class de.tilman_neumann.jml.base.BigRational
- complement(Mpi) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- complement(Mpi) - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Like subtract() but when we know that other fits piece-wise into this.
- compositeFactors - Variable in class de.tilman_neumann.jml.factor.base.FactorResult
-
factors that are certainly composite
- computeAll(int, int) - Method in class de.tilman_neumann.jml.gcd.EEA31
-
Computes gcd, a = (1/x) mod y and b = (1/y) mod x.
- computeAll(long, long) - Method in class de.tilman_neumann.jml.gcd.EEA63
-
Computes gcd, a = (1/x) mod y and b = (1/y) mod x.
- computeBestBlockCount(int, int) - Static method in class de.tilman_neumann.jml.factor.siqs.sieve.BlockSieveUtil
- computeBlockLanczos(int[][], int) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.BlockLanczos
-
Block-Lanczos matrix solver.
- computeCAN(double) - Static method in class de.tilman_neumann.jml.smooth.CANEntry
-
Compute CAN(epsilon), where epsilon is a positive real number.
- computeHalf(int, int) - Method in class de.tilman_neumann.jml.gcd.EEA31
-
Computes only gcd and a = (1/x) mod y.
- computeHalf(long, long) - Method in class de.tilman_neumann.jml.gcd.EEA63
-
Computes only gcd and a = (1/x) mod y.
- computeMaxCurvesForN(BigInteger) - Static method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
- computeMultiplier(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.KnuthSchroeppel
-
Compute Knuth-Schroeppel multiplier k for N.
- computeMultiplier(BigInteger, int) - Method in class de.tilman_neumann.jml.factor.cfrac.KnuthSchroeppel_CFrac
- computeNextAParameter() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
- computeNextAParameter() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- computeReducedPrimeBase(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.base.PrimeBaseGenerator
-
Compute a reduced prime base containing the 2 and odd primes p with Jacobi(kN|p)>=0
- computeSHCN(double) - Static method in class de.tilman_neumann.jml.smooth.SHCNEntry
-
Compute SHCN(x), where x is a positive real number.
- computeTArray(int[], int, BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.ModularSqrtsEngine
-
For all primes p in the prime base, find the modular sqrt's of kN (mod p), i.e.
- CONF_ROOT - Static variable in class de.tilman_neumann.util.ConfigUtil
-
The base folder for all configuration files in this project.
- ConfigUtil - Class in de.tilman_neumann.util
-
Global configuration tasks.
- CongruenceCollector - Class in de.tilman_neumann.jml.factor.base.congruence
-
Collects smooth and partial congruences, and assembles partials to smooth congruences on-the-fly.
- CongruenceCollector() - Constructor for class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- CongruenceCollectorParallel - Class in de.tilman_neumann.jml.factor.base.congruence
-
Collects smooth and partial congruences, and assembles partials to smooth congruences on-the-fly.
- CongruenceCollectorParallel(int) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
- CongruenceCollectorReport - Class in de.tilman_neumann.jml.factor.base.congruence
- CongruenceCollectorReport(int, int, int[], int[], int, Multiset<Integer>, Multiset<Integer>, int, int) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- contains(Object) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- copyExponents() - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- copyExponents() - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- copyFactors() - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- copyFactors() - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- count - Variable in class de.tilman_neumann.jml.primes.exact.CollectingCallback
- COUNT_CYCLES - Static variable in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- countIndependentCycles(Partial) - Method in class de.tilman_neumann.jml.factor.base.congruence.CycleFinder
-
Counts the number of independent cycles in the partial relations following [LM94], [LLDMW02].
- CountingCallback - Class in de.tilman_neumann.jml.primes.exact
-
Simple callback just counting the primes coming in.
- CountingCallback() - Constructor for class de.tilman_neumann.jml.primes.exact.CountingCallback
- create(Mpi) - Static method in class de.tilman_neumann.jml.partitions.MpiPowerMap
- create(BigInteger, SortedIntegerArray, SortedLongArray) - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPairFactory
- createFactor2ColumnIndexMap(Map<Integer, ArrayList<Smooth>>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
-
Create a map from odd-exp-elements to matrix column indices.
- createFactor2ColumnIndexMap(Map<Long, ArrayList<Partial>>) - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
-
Create a map from factors appearing with odd exponent to matrix column indices.
- createFrom(SortedMultiset<BigInteger>) - Static method in class de.tilman_neumann.jml.partitions.PrimePowers_DefaultImpl
-
Constructor from a multiset of primes.
- createThread(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS_SBH_U
- createThread(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS_U
- createThread(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS
- createThread(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- curve - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm63.EcmResult
- curve - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline.EcmResult
- curve - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr.EcmResult
- curve - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64.EcmResult
- CycleFinder - Class in de.tilman_neumann.jml.factor.base.congruence
-
Algorithms to count and find independent cycles in partial relations containing partials with 2 or 3 large primes.
- CycleFinder(int) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.CycleFinder
-
Full constructor.
D
- de.tilman_neumann.jml - package de.tilman_neumann.jml
- de.tilman_neumann.jml.base - package de.tilman_neumann.jml.base
- de.tilman_neumann.jml.combinatorics - package de.tilman_neumann.jml.combinatorics
- de.tilman_neumann.jml.factor - package de.tilman_neumann.jml.factor
- de.tilman_neumann.jml.factor.base - package de.tilman_neumann.jml.factor.base
- de.tilman_neumann.jml.factor.base.congruence - package de.tilman_neumann.jml.factor.base.congruence
- de.tilman_neumann.jml.factor.base.matrixSolver - package de.tilman_neumann.jml.factor.base.matrixSolver
- de.tilman_neumann.jml.factor.cfrac - package de.tilman_neumann.jml.factor.cfrac
- de.tilman_neumann.jml.factor.cfrac.tdiv - package de.tilman_neumann.jml.factor.cfrac.tdiv
- de.tilman_neumann.jml.factor.ecm - package de.tilman_neumann.jml.factor.ecm
- de.tilman_neumann.jml.factor.hart - package de.tilman_neumann.jml.factor.hart
- de.tilman_neumann.jml.factor.lehman - package de.tilman_neumann.jml.factor.lehman
- de.tilman_neumann.jml.factor.pollardRho - package de.tilman_neumann.jml.factor.pollardRho
- de.tilman_neumann.jml.factor.psiqs - package de.tilman_neumann.jml.factor.psiqs
- de.tilman_neumann.jml.factor.siqs - package de.tilman_neumann.jml.factor.siqs
- de.tilman_neumann.jml.factor.siqs.data - package de.tilman_neumann.jml.factor.siqs.data
- de.tilman_neumann.jml.factor.siqs.poly - package de.tilman_neumann.jml.factor.siqs.poly
- de.tilman_neumann.jml.factor.siqs.poly.baseFilter - package de.tilman_neumann.jml.factor.siqs.poly.baseFilter
- de.tilman_neumann.jml.factor.siqs.powers - package de.tilman_neumann.jml.factor.siqs.powers
- de.tilman_neumann.jml.factor.siqs.sieve - package de.tilman_neumann.jml.factor.siqs.sieve
- de.tilman_neumann.jml.factor.siqs.tdiv - package de.tilman_neumann.jml.factor.siqs.tdiv
- de.tilman_neumann.jml.factor.squfof - package de.tilman_neumann.jml.factor.squfof
- de.tilman_neumann.jml.factor.tdiv - package de.tilman_neumann.jml.factor.tdiv
- de.tilman_neumann.jml.gcd - package de.tilman_neumann.jml.gcd
- de.tilman_neumann.jml.hyperbolic - package de.tilman_neumann.jml.hyperbolic
- de.tilman_neumann.jml.modular - package de.tilman_neumann.jml.modular
- de.tilman_neumann.jml.partitions - package de.tilman_neumann.jml.partitions
- de.tilman_neumann.jml.powers - package de.tilman_neumann.jml.powers
- de.tilman_neumann.jml.precision - package de.tilman_neumann.jml.precision
- de.tilman_neumann.jml.primes - package de.tilman_neumann.jml.primes
- de.tilman_neumann.jml.primes.bounds - package de.tilman_neumann.jml.primes.bounds
- de.tilman_neumann.jml.primes.exact - package de.tilman_neumann.jml.primes.exact
- de.tilman_neumann.jml.primes.probable - package de.tilman_neumann.jml.primes.probable
- de.tilman_neumann.jml.quadraticResidues - package de.tilman_neumann.jml.quadraticResidues
- de.tilman_neumann.jml.roots - package de.tilman_neumann.jml.roots
- de.tilman_neumann.jml.sequence - package de.tilman_neumann.jml.sequence
- de.tilman_neumann.jml.smooth - package de.tilman_neumann.jml.smooth
- de.tilman_neumann.jml.transcendental - package de.tilman_neumann.jml.transcendental
- de.tilman_neumann.util - package de.tilman_neumann.util
- decimalToBinary(int) - Static method in class de.tilman_neumann.jml.precision.Magnitude
-
Computes the number of binary digits analogous to the specified number of decimal digits.
- DEFAULT - Static variable in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
The best available single-threaded factor algorithm.
- degree() - Method in class de.tilman_neumann.jml.base.BigIntPoly
- DESCENDING - de.tilman_neumann.util.SortOrder
-
Descending order.
- digits() - Method in class de.tilman_neumann.jml.precision.Precision
- digits() - Method in class de.tilman_neumann.jml.precision.Scale
- div2() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- div2() - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Computes a kind of division by 2 of this.
- divide(BigRational) - Method in class de.tilman_neumann.jml.base.BigRational
-
Computes the fraction of this and the argument.
- divide(BigDecimal, BigDecimal, Precision) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
- divide(BigDecimal, BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Division with guaranteed precision.
- divide(BigDecimal, BigInteger, Precision) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
- divide(BigDecimal, BigInteger, Scale) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Division by an integer.
- divide(BigInteger) - Method in class de.tilman_neumann.jml.base.BigRational
-
Computes the fraction of this and the argument.
- divideAndRemainder(int, UnsignedBigInt) - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Divide this by the given
divisor
, store the quotient inquotient
and return the remainder. - divideAndRemainder_v1(int, UnsignedBigInt) - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Deprecated.
- Divisors - Class in de.tilman_neumann.jml
-
Implementations for finding all divisors of an integer.
- divPow2(BigDecimal, int) - Static method in class de.tilman_neumann.jml.powers.Pow2
-
Division by the n.th power of 2.
- DoubleBlockHybridSieve - Class in de.tilman_neumann.jml.factor.siqs.sieve
-
Combination of a monolithic sieve for large primes > sieveArraySize/3, and a single block sieve for p < sieveArraySize/3.
- DoubleBlockHybridSieve(int, int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
-
Full constructor.
- DoubleBlockHybridSieveU - Class in de.tilman_neumann.jml.factor.siqs.sieve
-
Combination of a monolithic sieve for large primes > sieveArraySize/3, and a single block sieve for p < sieveArraySize/3.
- DoubleBlockHybridSieveU(int, int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
-
Full constructor.
- DoubleBlockSieve - Class in de.tilman_neumann.jml.factor.siqs.sieve
-
Double block sieve implementation, essentially following [Wambach, Wettig 1995].
- DoubleBlockSieve(int, int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
-
Full constructor.
- doubleValue() - Method in class de.tilman_neumann.jml.base.BigRational
- doubleValue() - Method in class de.tilman_neumann.jml.base.Uint128
- Dusart1999(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Dusart 1999 page 14 for n >= 39017.
- Dusart2010_eq6_5(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Dusart 2010 theorem 6.9, eq.
- Dusart2010_eq6_6(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Dusart 2010 theorem 6.9, eq.
- Dusart2010_eq6_7(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Dusart 2010 theorem 6.9, eq.
- Dusart2010p7(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Dusart 2010 page 7, Lemma 6.5: Holds for n >= 178974.
- Dusart2010p8(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Dusart 2010 page 8, Proposition 6.6: Holds for n >= 688383.
E
- EcmResult(long, int) - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm63.EcmResult
- EcmResult(long, int) - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline.EcmResult
- EcmResult(long, int) - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr.EcmResult
- EcmResult(long, int) - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64.EcmResult
- EEA31 - Class in de.tilman_neumann.jml.gcd
-
Extended Euclidean algorithm, mostly used to compute the modular inverse of x (mod y).
- EEA31() - Constructor for class de.tilman_neumann.jml.gcd.EEA31
- EEA31.Result - Class in de.tilman_neumann.jml.gcd
- EEA63 - Class in de.tilman_neumann.jml.gcd
-
Extended Euclidean algorithm, mostly used to compute the modular inverse of x (mod y).
- EEA63() - Constructor for class de.tilman_neumann.jml.gcd.EEA63
- EEA63.Result - Class in de.tilman_neumann.jml.gcd
- EgyptianFractionsTriangle - Class in de.tilman_neumann.jml
-
Computes the number of terms/steps the Greedy algorithm requires to find a sum of simple quotients for any k/n; 0
- EgyptianFractionsTriangle(int) - Constructor for class de.tilman_neumann.jml.EgyptianFractionsTriangle
- EllipticCurveMethod - Class in de.tilman_neumann.jml.factor.ecm
Use Elliptic Curve Method to find the prime number factors of a given BigInteger.- EllipticCurveMethod(int) - Constructor for class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
Full constructor.- EllipticCurveMethodTest - Class in de.tilman_neumann.jml.factor.ecm
- EllipticCurveMethodTest() - Constructor for class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethodTest
- ensureLimit(int) - Method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
Ensures that the array contains all primes <= x.- ensurePrimeCount(int) - Method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
Ensures that the array contains at least the first 'desiredCount' primes.- equals(Object) - Method in class de.tilman_neumann.jml.base.BigRational
- equals(Object) - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- equals(Object) - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
hashCode() and equals() must be based on A to avoid duplicates.- equals(Object) - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
Checks if this composite smooth relation is equal to another object. Simple smooths (having exactly one AQPair) and composite smooths (having strictly more than one AQPair) can never be equal; hence it is correct to have two separate equals() implementations that reject all objects of the other type.- equals(Object) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- equals(Object) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- equals(Object) - Method in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- equals(Object) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- equals(Object) - Method in class de.tilman_neumann.jml.precision.Precision
- equals(Object) - Method in class de.tilman_neumann.jml.precision.Scale
- equals(Object) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
Unordered multisets are equal if they have exactly the same elements and these elements the same multiplicity, no matter in which iteration order the elements appear.- equals(Object) - Method in class de.tilman_neumann.util.Pair
- equals(BigInteger) - Method in class de.tilman_neumann.jml.base.BigRational
- EulerConstant - Class in de.tilman_neumann.jml.transcendental
- EulerConstant() - Constructor for class de.tilman_neumann.jml.transcendental.EulerConstant
- EulerFormula(int, int) - Method in class de.tilman_neumann.jml.modular.LegendreSymbol
Computes the Legendre symbol L(a|p) via Eulers formula for a, p int.- EulerFormula(BigInteger, int) - Method in class de.tilman_neumann.jml.modular.LegendreSymbol
Computes the Legendre symbol L(a|p) via Eulers formula.- EulerFormula(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.LegendreSymbol
Computes the Legendre symbol L(a|p) via Eulers formula.- exactSqrt(BigInteger) - Static method in class de.tilman_neumann.jml.roots.SqrtExact
Return sqrt(n) if n is a square of an integer, null otherwise.- exp - Variable in class de.tilman_neumann.jml.factor.base.FactorArguments
The exponent of N- exp(BigDecimal, Precision) - Static method in class de.tilman_neumann.jml.transcendental.Exp
- exp(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.transcendental.Exp
Compute exp(w) using a more powerful argument reduction.- Exp - Class in de.tilman_neumann.jml.transcendental
Implementation of the exponential function for big decimals.- Exp() - Constructor for class de.tilman_neumann.jml.transcendental.Exp
- expandTo(BigInteger) - Method in class de.tilman_neumann.jml.base.BigRational
- exponent - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- exponent - Variable in class de.tilman_neumann.jml.powers.PurePowerTest.Result
- exponents - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
exponents of primesF
- f - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm63.EcmResult
- f - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline.EcmResult
- f - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr.EcmResult
- f - Variable in class de.tilman_neumann.jml.factor.ecm.TinyEcm64.EcmResult
- F_0 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_0_5 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_1 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_10 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_12 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_2 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_2_5 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_3 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_4 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_5 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- F_8 - Static variable in class de.tilman_neumann.jml.base.BigDecimalConstants
- factor - Variable in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
- factor(BigInteger) - Method in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
Decomposes the argument N into prime factors.
- factor(BigInteger, int, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
-
Find all factor of NBig, which must have less than 32 bit.
- factor(BigInteger, int, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
-
Find all factor of NBig, which must have less than 32 bit.
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
Decomposes the argument N into prime factors.
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63
- factor(BigInteger, SortedMultiset<BigInteger>) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
- FactorAlgorithm - Class in de.tilman_neumann.jml.factor
-
Abstraction of integer factorization algorithms.
- FactorAlgorithm() - Constructor for class de.tilman_neumann.jml.factor.FactorAlgorithm
- FactorAlgorithm(Integer) - Constructor for class de.tilman_neumann.jml.factor.FactorAlgorithm
- FactorArguments - Class in de.tilman_neumann.jml.factor.base
- FactorArguments(BigInteger, int) - Constructor for class de.tilman_neumann.jml.factor.base.FactorArguments
-
Full constructor.
- FactorException - Exception in de.tilman_neumann.jml.factor
-
An exception indicating that a factor was found.
- FactorException(BigInteger) - Constructor for exception de.tilman_neumann.jml.factor.FactorException
-
Complete constructor.
- factorial(int) - Static method in class de.tilman_neumann.jml.combinatorics.Factorial
-
Peter Luschny's swinging prime factorial algorithm, see http://luschny.de/math/factorial/SwingIntro.pdf
- Factorial - Class in de.tilman_neumann.jml.combinatorics
-
Implementations of the factorial function.
- Factorial() - Constructor for class de.tilman_neumann.jml.combinatorics.Factorial
- factorIInteger(IInteger) - Method in class org.matheclipse.gpl.numbertheory.BigIntegerPrimality
- factorInteger(BigInteger) - Method in class org.matheclipse.gpl.numbertheory.BigIntegerPrimality
-
Decomposes the argument
n
into prime factors. - factorInteger(BigInteger, SortedMultiset<BigInteger>) - Method in class org.matheclipse.gpl.numbertheory.BigIntegerPrimality
-
Decomposes the argument
n
into prime factors. - FactorizerTest - Class in de.tilman_neumann.jml.factor
-
Main class to compare the performance of factor algorithms.
- FactorizerTest() - Constructor for class de.tilman_neumann.jml.factor.FactorizerTest
- FactorResult - Class in de.tilman_neumann.jml.factor.base
- FactorResult(SortedMultiset<BigInteger>, SortedMultiset<BigInteger>, SortedMultiset<BigInteger>, long) - Constructor for class de.tilman_neumann.jml.factor.base.FactorResult
-
Full constructor.
- FactorTest - Interface in de.tilman_neumann.jml.factor.base.matrixSolver
-
Interface for final factor tests when a square congruence A^2 == Q (mod kN) has been found.
- FactorTest01 - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
Factor test using modular reduction (mod N).
- FactorTest01(BigInteger) - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest01
- fallingFactorial(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.FallingFactorial
-
Computes the falling factorial.
- FallingFactorial - Class in de.tilman_neumann.jml.combinatorics
-
Implementations of the falling factorial (n)_k = (n-k+1)*...*n.
- FallingFactorial() - Constructor for class de.tilman_neumann.jml.combinatorics.FallingFactorial
- FermatCatalanConjectureTest - Class in de.tilman_neumann.jml
-
Search for a^m + b^n = c^k with a,b,c , m,n,k integer, a,b,c coprime, and 1/m+1/n+1/k<1.
- FermatCatalanConjectureTest() - Constructor for class de.tilman_neumann.jml.FermatCatalanConjectureTest
- FILE_SEPARATOR - Static variable in class de.tilman_neumann.util.ConfigUtil
-
File separator used on this OS.
- filter(SolutionArrays, BaseArrays, int, int[], int, int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q1
- filter(SolutionArrays, BaseArrays, int, int[], int, int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q2
- filter(SolutionArrays, BaseArrays, int, int[], int, int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_qk
- filter(SolutionArrays, BaseArrays, int, int[], int, int) - Method in interface de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter
-
Filter base arrays, fill solutionArrays with the result.
- filteredBaseSize - Variable in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter.Result
- filteredOutBaseElements - Variable in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter.Result
- findIndependentCycles() - Method in class de.tilman_neumann.jml.factor.base.congruence.CycleFinder
-
Finds independent cycles and uses them to combine partial to smooth relations, following [LLDMW02].
- findPowers(BigInteger, int[], int[], int, SieveParams) - Method in class de.tilman_neumann.jml.factor.siqs.powers.AllPowerFinder
-
Find all powers with pMin < power < pMax.
- findPowers(BigInteger, int[], int[], int, SieveParams) - Method in class de.tilman_neumann.jml.factor.siqs.powers.PowerOfSmallPrimesFinder
-
Find the first powers > pMin.
- findSingleFactor(int) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31
- findSingleFactor(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31
- findSingleFactor(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
- findSingleFactor(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast2Mult
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Simple
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Squarefree
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race2
-
Find a factor of long N.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringMostN
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringSameN
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKMods
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKStructure
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeModPowersOf2
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeSpecialArguments
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_CustomKOrder
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Fast
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Simple
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Smith
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery63
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31
-
Find a factor of the given composite N. Warning: This method will not return when called with a prime argument.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
-
Find a factor of the given composite N. Warning: This method will not return when called with a prime argument.
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF63
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63
- findSingleFactor(long) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
- findSingleFactor(long, int) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences2
- findSingleFactor(long, Lehman_AnalyzeKProgressions.Progression) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions
- findSingleFactor(long, Lehman_AnalyzeKProgressions2.Progression) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions2
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac63
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm63
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
Find a single factor of the given N, which is composite and odd.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast2Mult
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Simple
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_Squarefree
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race2
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.hart.HartLA63
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_CustomKOrder
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Fast
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Simple
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Smith
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho_ProductGcd
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho31
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery63
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.SIQS_Small
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.SIQS
-
Test the current N.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF63
-
Find a factor of the given composite N. Warning: This method will not return when called with a prime argument.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv
-
Find a single factor of the given N, which is composite and odd.
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63
- findSingleFactor(BigInteger) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
-
Find a single factor of the given N, which is composite and odd.
- FIRST_FACTOR - de.tilman_neumann.jml.factor.TestMode
-
Find the first factor of some N.
- firstNonZeroPartIndex() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- firstNonZeroPartIndex() - Method in interface de.tilman_neumann.jml.partitions.Mpi
- floatValue() - Method in class de.tilman_neumann.jml.base.BigRational
- floorInt() - Method in class de.tilman_neumann.jml.base.BigRational
- floorInt(BigDecimal) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Returns floor(x) as a big integer.
- formatLeft(String, String) - Static method in class de.tilman_neumann.util.StringUtil
-
Inserts a string s left-aligned into a mask, without truncation.
Examples:
formatLeft("abc", "123456") -> "abc456"
formatLeft("abcdef", "123") -> "abcdef" - formatRight(String, String) - Static method in class de.tilman_neumann.util.StringUtil
-
Inserts a string s right-aligned into a mask, without truncation.
Examples:
formatRight("abc", "123456") -> "123abc"
formatRight("abcdef", "123") -> "abcdef" - frac(BigDecimal) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Returns the fractional part of x, with the same scale than x.
- freeMemory(long) - Static method in class de.tilman_neumann.jml.factor.base.UnsafeUtil
-
Release a native memory block.
- fromDouble(double) - Static method in class de.tilman_neumann.jml.base.BigIntConverter
-
Create a BigInteger from double, with minimal precision loss.
- fromDoubleMulPow2(double, int) - Static method in class de.tilman_neumann.jml.base.BigIntConverter
-
Compute BigInteger from double multiplied with a power of 2, i.e.
G
- g - Variable in class de.tilman_neumann.jml.gcd.EEA31.Result
-
gcd
- g - Variable in class de.tilman_neumann.jml.gcd.EEA63.Result
-
gcd
- gamma(Scale) - Static method in class de.tilman_neumann.jml.transcendental.EulerConstant
- gcd(int, int) - Method in class de.tilman_neumann.jml.gcd.Gcd31
-
Faster binary gcd adapted from OpenJdk's MutableBigInteger.binaryGcd(int, int).
- gcd(long, long) - Method in class de.tilman_neumann.jml.gcd.Gcd63
-
Faster binary gcd adapted from OpenJdk's MutableBigInteger.binaryGcd(int, int).
- gcd(BigInteger[]) - Static method in class de.tilman_neumann.jml.gcd.Gcd
-
GCD of k arguments n1, n2, ..., nk.
- gcd(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.gcd.Gcd
-
Slightly faster binary gcd adapted from OpenJdk's MutableBigInteger.binaryGcd(int, int).
- gcd(Collection<Integer>) - Method in class de.tilman_neumann.jml.gcd.Gcd31
-
GCD of all arguments.
- gcd(Collection<Long>) - Method in class de.tilman_neumann.jml.gcd.Gcd63
-
GCD of all arguments.
- gcd(Collection<BigInteger>) - Static method in class de.tilman_neumann.jml.gcd.Gcd
-
GCD of k arguments n1, n2, ..., nk.
- Gcd - Class in de.tilman_neumann.jml.gcd
-
GCD implementations for BigIntegers.
- Gcd() - Constructor for class de.tilman_neumann.jml.gcd.Gcd
- gcd_binary1(int, int) - Method in class de.tilman_neumann.jml.gcd.Gcd31
-
Binary gcd implementation.
- gcd_binary1(long, long) - Method in class de.tilman_neumann.jml.gcd.Gcd63
-
Binary gcd implementation.
- gcd_binary1(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.gcd.Gcd
-
Binary gcd implementation.
- gcd_euclid_withDivision(int, int) - Method in class de.tilman_neumann.jml.gcd.Gcd31
-
Greatest common divisor of the given two arguments.
- gcd_euclid_withDivision(long, long) - Method in class de.tilman_neumann.jml.gcd.Gcd63
-
Greatest common divisor of the given two arguments.
- gcd_euclid_withDivision(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.gcd.Gcd
-
Greatest common divisor of the given two arguments.
- gcd_euclid_withoutDivision(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.gcd.Gcd
- Gcd31 - Class in de.tilman_neumann.jml.gcd
-
GCD implementations for 32-bit integers.
- Gcd31() - Constructor for class de.tilman_neumann.jml.gcd.Gcd31
- Gcd63 - Class in de.tilman_neumann.jml.gcd
-
GCD implementations for longs.
- Gcd63() - Constructor for class de.tilman_neumann.jml.gcd.Gcd63
- generate(int, int, TestNumberNature) - Static method in class de.tilman_neumann.jml.factor.TestsetGenerator
-
Generate N_count random numbers of the given size and nature.
- Generator<T> - Interface in de.tilman_neumann.jml.partitions
-
A generator for a sequence of objects of type
. - get() - Static method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
- get(int) - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- get(int) - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- get(int, int) - Method in class de.tilman_neumann.jml.base.BigIntTriangle
-
Returns the entry T[n,k], with T[1,1] being the very first element.
- getA() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
- getA004215(long) - Static method in class de.tilman_neumann.jml.SumOf4Squares
-
Compute all elements of A004215 below m, i.e.
- getA004215_v2(int) - Static method in class de.tilman_neumann.jml.SumOf4Squares
-
Compute all elements of A004215 below m = 2^n, i.e.
- getA004215_v3(int, long[]) - Static method in class de.tilman_neumann.jml.SumOf4Squares
-
Another implementation using arrays, much faster than the previous ones.
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_1Large
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_2Large
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_nLarge
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_1LargeSquare
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_nLargeSquares
- getAllQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Perfect
- getAQPairs() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- getAQPairs() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Simple
- getAQPairs() - Method in interface de.tilman_neumann.jml.factor.base.congruence.Smooth
- getBiggestColumnIndex() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- getBiggestDivisorBelowSqrtN(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
-
Find the biggest divisor of n <= sqrt(n).
- getBiggestDivisorBelowSqrtN(BigInteger, SortedMap<BigInteger, Integer>) - Static method in class de.tilman_neumann.jml.Divisors
-
Find the biggest divisor of n <= sqrt(n) given the prime factorization of n.
- getCAN() - Method in class de.tilman_neumann.jml.smooth.CANEntry
- getCardinality() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- getCardinality() - Method in interface de.tilman_neumann.jml.partitions.Mpi
- getCollectDuration() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
- getComplementOfQuadraticResiduesMod2PowN(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
-
Returns the "complement" of quadratic residues modulo 2^n.
- getCount() - Method in class de.tilman_neumann.jml.primes.exact.CountingCallback
- getCycleCountResult() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- getCycleCountResult() - Method in class de.tilman_neumann.jml.factor.base.congruence.CycleFinder
- getDenominator() - Method in class de.tilman_neumann.jml.base.BigRational
- getDim() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- getDim() - Method in interface de.tilman_neumann.jml.partitions.Mpi
- getDivisorCount(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
-
Computes the number of positive divisors of the given argument.
- getDivisorCount(SortedMap<BigInteger, Integer>) - Static method in class de.tilman_neumann.jml.Divisors
-
Computes the number of positive divisors given the prime factorization of a number.
- getDivisors(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
-
Delivers the set of divisors of the argument, including 1 and n.
- getDivisors(SortedMap<BigInteger, Integer>) - Static method in class de.tilman_neumann.jml.Divisors
-
Bottom-up divisors construction algorithm.
- getDivisorsWithoutOneAndX(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
-
Delivers the set of divisors of the argument except for 1 and n.
- getElem(int) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- getElem(int) - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Returns the entry of the given index, with 0<=index
- getEpsilon() - Method in class de.tilman_neumann.jml.smooth.CANEntry
- getErrorBound() - Method in class de.tilman_neumann.jml.precision.Scale
The error a computation with this scale should not exceed.- getEvenQuadraticResidues(long) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResidues
Get the quadratic residues of even "k" modulo m, computed by brute force.- getExponent(int) - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- getExponent(int) - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- getExponents() - Method in class de.tilman_neumann.jml.smooth.CANEntry
- getExponents() - Method in class de.tilman_neumann.jml.smooth.SHCNEntry
- getExponentSum() - Method in class de.tilman_neumann.jml.smooth.CANEntry
- getExponentSum() - Method in class de.tilman_neumann.jml.smooth.SHCNEntry
- getFactor() - Method in exception de.tilman_neumann.jml.factor.FactorException
- getFactorizer() - Static method in class org.matheclipse.gpl.numbertheory.BigIntegerPrimality
- getFirst() - Method in class de.tilman_neumann.util.Pair
- getHigh() - Method in class de.tilman_neumann.jml.base.Uint128
- getInitializerBlock() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
- getInsertPosition(int) - Method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
- getInsertPosition(int[], int, int) - Method in class de.tilman_neumann.jml.BinarySearch
Find the insert position for x into array given that array is sorted bottom-up.- getInstance() - Static method in class de.tilman_neumann.jml.primes.probable.TDivPrimeTest
- getLargeFactorsWithOddExponent() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_1Large
- getLargeFactorsWithOddExponent() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_2Large
- getLargeFactorsWithOddExponent() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_nLarge
- getLargeFactorsWithOddExponent() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial
- getLow() - Method in class de.tilman_neumann.jml.base.Uint128
- getMatrixElements() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- getMatrixElements() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Simple
- getMatrixElements() - Method in interface de.tilman_neumann.jml.factor.base.congruence.Smooth
- getMultiplier() - Method in enum de.tilman_neumann.util.SortOrder
- getName() - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
- getName() - Method in interface de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest
- getName() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest01
- getName() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
- getName() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver01_Gauss
- getName() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver02_BlockLanczos
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac63
- getName() - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF03
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_01
- getName() - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- getName() - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63
- getName() - Method in class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
- getName() - Method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
- getName() - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm63
- getName() - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline
- getName() - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
- getName() - Method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64
- getName() - Method in class de.tilman_neumann.jml.factor.FactorAlgorithm
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_Fast2Mult
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_Simple
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_Squarefree
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race
- getName() - Method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race2
- getName() - Method in class de.tilman_neumann.jml.factor.hart.HartLA63
- getName() - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_CustomKOrder
- getName() - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Fast
- getName() - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Simple
- getName() - Method in class de.tilman_neumann.jml.factor.lehman.Lehman_Smith
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho_ProductGcd
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRho31
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery63
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
- getName() - Method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
- getName() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS_SBH_U
- getName() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS_U
- getName() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQS
- getName() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- getName() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q1
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_q2
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter_qk
- getName() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.powers.AllPowerFinder
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.powers.NoPowerFinder
- getName() - Method in interface de.tilman_neumann.jml.factor.siqs.powers.PowerFinder
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.powers.PowerOfSmallPrimesFinder
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- getName() - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.SIQS_Small
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.SIQS
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- getName() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- getName() - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
- getName() - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31
- getName() - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
- getName() - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF63
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63
- getName() - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
- getName() - Method in interface de.tilman_neumann.jml.sequence.NumberSequence
- getName() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence
- getName() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence63
- getNonIntFactorPercentages() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getNumberOfColumns() - Method in class de.tilman_neumann.jml.base.NumberGrid
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_1Large
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_2Large
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Partial_nLarge
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_1LargeSquare
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_nLargeSquares
- getNumberOfLargeQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Perfect
- getNumberOfQuadraticResiduesMod2PowN(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute A23105(n), the number of distinct quadratic residues mod 2^n, via the formula by David S.- getNumberOfRealizations() - Method in class de.tilman_neumann.jml.partitions.IntegerPartition
- getNumerator() - Method in class de.tilman_neumann.jml.base.BigRational
- getOperationDetails() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getOperationDetails() - Method in class de.tilman_neumann.jml.factor.siqs.poly.PolyReport
- getOperationDetails() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
- getPackageName(Class<?>) - Static method in class de.tilman_neumann.util.ReflectionUtil
Returns the package name for the given class.- getPartialBigFactorSizes() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getPartialCongruenceCount() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- getPartialQSignCounts() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getPhaseTimings(int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.PolyReport
- getPhaseTimings(int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SieveReport
- getPhaseTimings(int) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
- getPolyReport() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- getPrime(int) - Method in class de.tilman_neumann.jml.partitions.PrimePowers_DefaultImpl
- getPrime(int) - Method in interface de.tilman_neumann.jml.partitions.PrimePowers
Return the prime at the given index.- getPrime(int) - Method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
Get the n.th prime, e.g.- getPrimes() - Method in class de.tilman_neumann.jml.smooth.CANEntry
- getPrimes() - Method in class de.tilman_neumann.jml.smooth.SHCNEntry
- getQArray() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
- getQArray() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- getQCount() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
- getQCount() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- getQRestSizes() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
- getQTArray() - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
- getQTArray() - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- getQuadraticResidues(long) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResidues
Return all quadratic residues modulo m, computed by brute force.- getQuadraticResiduesMod2PowN(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute all quadratic residues modulus 2^n.- getQuadraticResiduesMod2PowN(int, long[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute all quadratic residues modulus 2^n.- getQuadraticResiduesMod2PowN_testAll(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute all quadratic residues modulus 2^n.- getQuadraticResiduesMod2PowN_testAll_big(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute all quadratic residues modulus 2^n.- getQuadraticResiduesMod2PowN_testAll_v2(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
Compute all quadratic residues modulus 2^n.- getQuadraticResiduesMod3PowN(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowN
Compute all quadratic residues modulus 3^n.- getQuadraticResiduesMod3PowN_testAll(int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowN
Compute all quadratic residues modulus 3^n.- getQuadraticResiduesModBPowN(int, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
Compute all quadratic residues modulus p^n.- getQuadraticResiduesModBPowN_testAll(int, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
Compute all quadratic residues modulus p^n.- getQuadraticResiduesModBPowN_testAll_v2(int, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
Compute all quadratic residues modulus p^n.- getReport() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- getReport() - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- getReport() - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- getReport() - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
- getResultMagnitude(BigDecimal, BigDecimal) - Static method in class de.tilman_neumann.jml.transcendental.Agm
Computes an estimate of the size of agm(a, b) in decimal digits.- getRow(int) - Method in class de.tilman_neumann.jml.base.BigIntTriangle
return n.th row, where the first row has index 1.- getRowIndexHistoryAsList() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- getRows() - Method in class de.tilman_neumann.jml.base.NumberGrid
- getRowSum(int) - Method in class de.tilman_neumann.jml.base.BigIntTriangle
Returns the sum over all entries of the n.th row, where the first row has index 1.- getRowSums() - Method in class de.tilman_neumann.jml.base.BigIntTriangle
- getSecond() - Method in class de.tilman_neumann.util.Pair
- getSHCN() - Method in class de.tilman_neumann.jml.smooth.SHCNEntry
- getSieveReport() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- getSmallDivisors(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
- getSmallDivisors(BigInteger, SortedMap<BigInteger, Integer>) - Static method in class de.tilman_neumann.jml.Divisors
Bottom-up divisors construction algorithm for all divisor <= sqrt(n).- getSmallDivisors_v1(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
Compute all positive divisors d of n with d <= lower(sqrt(n)).- getSmallQFactors() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
Building block to implement the method above.- getSmoothBigFactorPercentiles() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getSmoothBigFactorSizes() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getSmoothCongruenceCount() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- getSmoothCongruences() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
- getSmoothQSignCounts() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorReport
- getSolverDuration() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
- getSolverRunCount() - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
- getSubvaluesLessOrEqual(Mpi, Mpi) - Method in class de.tilman_neumann.jml.partitions.MpiPowerMap
Delivers all subvalues (piece-wise relation) of x not bigger (ordering relation) than biggestElem.- getTDivReport() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- getTestedNullVectorCount() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
- getTotalDuration(int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.PolyReport
- getTotalDuration(int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SieveReport
- getTotalDuration(int) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
- getUnsafe() - Static method in class de.tilman_neumann.jml.factor.base.UnsafeUtil
- getX() - Method in class de.tilman_neumann.jml.smooth.SHCNEntry
- GlobalFactoringOptions - Interface in de.tilman_neumann.jml.factor.base
Global factoring settings.H
- harmonic(int) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Simple series computation of harmonic numbers H_{n} = 1/1 + 1/2 + 1/3 + ...
- harmonic_dbl(int) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Simple series computation of harmonic numbers H_{n} = 1/1 + 1/2 + 1/3 + ...
- harmonic_lowerBound(BigInteger, Scale) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Lower bound for the harmonic number H_n.
- harmonic_upperBound(BigInteger, Scale) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Upper bound for the harmonic number H_n.
- HarmonicNumbers - Class in de.tilman_neumann.jml
-
Computation of harmonic and "hyper-harmonic" numbers.
- harmonicPower(int, int) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Harmonic power series H_{n,r} = sum_{i=1..n} 1/i^r.
- Hart_AnalyzeCongruences - Class in de.tilman_neumann.jml.factor.hart
-
Analyze the congruences best matching Hart's one-line factor algorithm when tested with 4kN values, where k are multiples of some K_MULT.
- Hart_AnalyzeCongruences() - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeCongruences
- Hart_AnalyzeSquareCongruences - Class in de.tilman_neumann.jml.factor.hart
-
Analyze until which s we obtain test == "some square" (mod 2^s).
- Hart_AnalyzeSquareCongruences(boolean) - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences
-
Full constructor.
- Hart_Fast - Class in de.tilman_neumann.jml.factor.hart
-
Pretty simple yet fast variant of Hart's one line factorizer.
- Hart_Fast(boolean) - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_Fast
-
Full constructor.
- Hart_Fast2Mult - Class in de.tilman_neumann.jml.factor.hart
-
Pretty simple yet fast variant of Hart's one line factorizer.
- Hart_Fast2Mult(boolean) - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_Fast2Mult
-
Full constructor.
- Hart_Simple - Class in de.tilman_neumann.jml.factor.hart
-
Simple implementation of Hart's one line factor algorithm.
- Hart_Simple() - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_Simple
- Hart_Squarefree - Class in de.tilman_neumann.jml.factor.hart
-
A variant of Hart's one line factorizer using k = 315 * s, where s is squarefree (1,2,3,5,6,7,10,11,13,...).
- Hart_Squarefree(boolean) - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_Squarefree
-
Full constructor.
- Hart_TDiv_Race - Class in de.tilman_neumann.jml.factor.hart
-
A factoring algorithm racing Hart's one line factorizer against trial division.
- Hart_TDiv_Race() - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race
-
Full constructor.
- Hart_TDiv_Race2 - Class in de.tilman_neumann.jml.factor.hart
-
A factoring algorithm racing Hart's one line factorizer against trial division.
- Hart_TDiv_Race2() - Constructor for class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race2
-
Full constructor.
- HartLA63 - Class in de.tilman_neumann.jml.factor.hart
-
Experimental Hart algorithm assembling square congruences from smooth congruences.
- HartLA63(float, float, TDiv_CF63, int, MatrixSolver) - Constructor for class de.tilman_neumann.jml.factor.hart.HartLA63
-
Standard constructor.
- hashCode() - Method in class de.tilman_neumann.jml.base.BigRational
- hashCode() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- hashCode() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
-
hashCode() and equals() must be based on A to avoid duplicates.
- hashCode() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- hashCode() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- hashCode() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- hashCode() - Method in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- hashCode() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- hashCode() - Method in class de.tilman_neumann.jml.precision.Precision
- hashCode() - Method in class de.tilman_neumann.jml.precision.Scale
- hashCode() - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- hashCode() - Method in class de.tilman_neumann.util.Pair
- hasNext() - Method in interface de.tilman_neumann.jml.partitions.Generator
- hasNext() - Method in class de.tilman_neumann.jml.partitions.IntegerPartitionGenerator
- hasNext() - Method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
- HyperFactorial - Class in de.tilman_neumann.jml.combinatorics
-
Hyperfactorials.
- HyperFactorial() - Constructor for class de.tilman_neumann.jml.combinatorics.HyperFactorial
- hyperharmonic_closedForm(int, int) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Closed-form evaluation of "hyper-harmonic numbers" defined by
H_{n,1} = sum_{i=1..n} 1/i
H_{n,r} = sum_{i=1..n} H_{i,r-1}; r>1 - hyperharmonic_recurrent(int, int) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
-
Recurrent computation of "hyper-harmonic numbers" defined by
H_{n,1} = sum_{i=1..n} 1/i
H_{n,r} = sum_{i=1..n} H_{i,r-1}; r>1
I
- I_0 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
0
- I_1 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
1
- I_10 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10
- I_100 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
100
- I_11 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
11
- I_12 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
12
- I_13 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
13
- I_14 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
14
- I_15 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
15
- I_16 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
16
- I_17 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
17
- I_18 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
18
- I_19 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
19
- I_1E10 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^10
- I_1E11 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^11
- I_1E12 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^12
- I_1E13 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^13
- I_1E14 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^14
- I_1E15 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^15
- I_1E16 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^16
- I_1E17 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^17
- I_1E18 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^18
- I_1E19 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^19
- I_1E20 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^20
- I_1E3 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
1000
- I_1E4 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10000
- I_1E5 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
100000
- I_1E6 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
a million
- I_1E7 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
ten million
- I_1E8 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
100 million
- I_1E9 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
10^9
- I_2 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
2
- I_20 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
20
- I_21 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
21
- I_22 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
22
- I_23 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
23
- I_24 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
24
- I_25 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
25
- I_26 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
26
- I_27 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
27
- I_28 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
28
- I_29 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
29
- I_3 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
3
- I_30 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
30
- I_31 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
31
- I_32 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
32
- I_37 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
37
- I_4 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
4
- I_40 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
40
- I_41 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
41
- I_43 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
43
- I_47 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
47
- I_48 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
48
- I_5 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
5
- I_50 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
50
- I_6 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
6
- I_60 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
60
- I_64 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
64
- I_7 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
7
- I_8 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
8
- I_9 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
9
- I_MAX_EXPONENT - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
max pow exponent
- I_MAX_INT - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
max integer
- I_MINUS_1 - Static variable in class de.tilman_neumann.jml.base.BigIntConstants
-
-1
- IndexSet - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
BitArray implementation of an IndexSet, realized in long[], used by the Gaussian solver.
- IndexSet(int) - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
-
Standard constructor, creates an empty bit array capable to hold the given numberOfBits.
- initialize(int, BigInteger, BigInteger, int, int, int[], int[], int) - Method in interface de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator
-
Initialize this a-parameter generator for a new N.
- initialize(int, BigInteger, BigInteger, int, int, int[], int[], int) - Method in class de.tilman_neumann.jml.factor.siqs.poly.AParamGenerator01
- initialize(BigInteger, double) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF
-
Initialize for a new N.
- initialize(BigInteger, double) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
- initialize(BigInteger, double) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02
- initialize(BigInteger, double) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF03
- initialize(BigInteger, double) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_01
- initialize(BigInteger, double) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- initialize(BigInteger, double) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63
-
Initialize for a new N.
- initialize(BigInteger, int, int[]) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF
-
Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
- initialize(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
- initialize(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02
- initialize(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF03
- initialize(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_01
- initialize(BigInteger, int, int[]) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- initialize(BigInteger, int, int[]) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63
-
Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
- initialize(BigInteger, int, MatrixSolver, FactorTest) - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollectorParallel
-
Initialize congruence collector for a new N.
- initialize(BigInteger, FactorTest) - Method in class de.tilman_neumann.jml.factor.base.congruence.CongruenceCollector
-
Initialize congruence collector for a new N.
- initialize(BigInteger, FactorTest) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
-
Initialize for a new N.
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- initializeForAParameter(SolutionArrays, int) - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
-
Set (filtered) prime base and smallest x1, x2 solutions for a new a-parameter.
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- initializeForAParameter(SolutionArrays, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- initializeForAParameter(BigInteger, int, BigInteger, SolutionArrays, int, int[]) - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
-
Set prime/power base, polynomial parameters and smallest x-solutions for a new a-parameter.
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- initializeForN(double, BigInteger, double) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- initializeForN(double, BigInteger, double) - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
-
Initialize this trial division engine for a new N.
- initializeForN(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, Sieve, TDiv_QS) - Method in class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
-
Initialize the polynomial generator for a new N.
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- initializeForN(SieveParams, int) - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
-
Initialize for a new N.
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- initializeForN(SieveParams, int) - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- initializer - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
sieve array initializer value
- initProject() - Static method in class de.tilman_neumann.util.ConfigUtil
-
Project configuration.
- IntCollectionUtil - Class in de.tilman_neumann.jml.base
-
Utility methods for collections of Integers.
- IntCollectionUtil() - Constructor for class de.tilman_neumann.jml.base.IntCollectionUtil
- IntegerPartition - Class in de.tilman_neumann.jml.partitions
-
Integer partition, with nice String output.
- IntegerPartition(int[]) - Constructor for class de.tilman_neumann.jml.partitions.IntegerPartition
-
Constructor from flat element array.
- IntegerPartitionGenerator - Class in de.tilman_neumann.jml.partitions
-
Integer partition generator, derived from fast multipartite number partition generator.
- IntegerPartitionGenerator(int) - Constructor for class de.tilman_neumann.jml.partitions.IntegerPartitionGenerator
-
Complete constructor for a generator of the partitions of n
- intersect(Multiset<T>) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- intLength() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- intValue() - Method in class de.tilman_neumann.jml.base.BigRational
- intValue() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- inverse(int) - Static method in class de.tilman_neumann.jml.combinatorics.HyperFactorial
-
A000197 or what I call the "inverse hyperfactorial" is the product 1^n*2^(n-1)*..*(n-1)^2*n^1 = 1!*2!*3!*...(n-1)!*n!.
- isEmpty() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- isExactSquare() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- isExactSquare() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Simple
- isExactSquare() - Method in interface de.tilman_neumann.jml.factor.base.congruence.Smooth
-
Test if the Q of this smooth congruence is an exact square.
- isNullVector() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- isOne() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Test for 1.
- isPrime(int) - Method in class de.tilman_neumann.jml.primes.probable.TDivPrimeTest
- isProbablePrime(long) - Method in class de.tilman_neumann.jml.primes.probable.BPSWTest
- isProbablePrime(long) - Method in class de.tilman_neumann.jml.primes.probable.PrPTest
- isProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.BPSWTest
- isProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.LucasTest
-
(Non-strong) Lucas probable prime test with parameters P=1, D some value in 5, -7, 9, -11, 13, -15, ...
- isProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.PrPTest
- isProbablePrime(BigInteger, int) - Method in class de.tilman_neumann.jml.primes.probable.MillerRabinTest
-
Perform up to numberOfRounds Miller-Rabin tests with random bases.
- iSqrt(BigInteger) - Static method in class de.tilman_neumann.jml.roots.SqrtInt
-
sqrt() computation with integer solutions using Herons (or "Babylonian") method and the built-in Math.sqrt() as initial guess, for any argument size and avoiding BigDecimals.
- iSqrt(BigInteger, BigInteger) - Static method in class de.tilman_neumann.jml.roots.SqrtInt
-
Simplest Heron-type sqrt() implementation.
- isQuadraticResidueMod2PowN(long, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
-
Computes if 'a' is a quadratic residue modulo 2^n.
- isQuadraticResidueMod2PowN(BigInteger, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
-
Computes if 'a' is a quadratic residue modulo 2^n.
- isQuadraticResidueMod2PowN_v1(long, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
-
Computes if 'a' is a quadratic residue modulo 2^n.
- isQuadraticResidueMod3PowN(long, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowN
-
Computes if 'a' is a quadratic residue modulo 3^n.
- isQuadraticResidueModBPowN(long, int, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
-
Computes if 'a' is a quadratic residue modulo p^n.
- isQuadraticResidueModBPowN_v2(long, int, int) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
-
Implementation following https://en.wikipedia.org/wiki/Quadratic_residue.
- IsSqrt_Test - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the moduli of a-values that help the Lehman algorithm to find factors.
- IsSqrt_Test() - Constructor for class de.tilman_neumann.jml.factor.lehman.IsSqrt_Test
- isStrongProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.LucasTest
-
Strong Lucas probable prime test with parameters P=1, D some value in 5, -7, 9, -11, 13, -15, ...
- isZero() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Test for 0.
- iterator() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- ithRoot(BigDecimal, int, Scale) - Static method in class de.tilman_neumann.jml.roots.RootsReal
-
Compute i.th root of x.
- ithRoot(BigDecimal, int, BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.roots.RootsReal
-
Compute the i.th root with initial guess.
- ithRoot(BigInteger, int) - Static method in class de.tilman_neumann.jml.roots.Roots
-
Computes the i.th root of N, using either a bitwise correction approach (for rather big roots
i
) or a Heron iteration procedure (for rather small rootsi
). - ithRoot_Heron1(BigInteger, int) - Static method in class de.tilman_neumann.jml.roots.Roots
-
Heron-style i.th root implementation.
- ithRoot_Heron2(BigInteger, int) - Static method in class de.tilman_neumann.jml.roots.Roots
-
Heron-style i.th root implementation.
J
- jacobiSymbol(int, int) - Method in class de.tilman_neumann.jml.modular.JacobiSymbol
- jacobiSymbol(int, BigInteger) - Method in class de.tilman_neumann.jml.modular.JacobiSymbol
- jacobiSymbol(BigInteger, int) - Method in class de.tilman_neumann.jml.modular.JacobiSymbol
- jacobiSymbol(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.JacobiSymbol
-
Jacobi symbol J(a|m), with m an odd, positive integer.
- JacobiSymbol - Class in de.tilman_neumann.jml.modular
-
Jacobi symbol.
- JacobiSymbol() - Constructor for class de.tilman_neumann.jml.modular.JacobiSymbol
- JacobiTest - Class in de.tilman_neumann.jml.modular
-
Test of Legendre and Jacobi symbol.
- JacobiTest() - Constructor for class de.tilman_neumann.jml.modular.JacobiTest
- JAVA_CLASS_PATH - Static variable in class de.tilman_neumann.util.ConfigUtil
-
Java class path
- JAVA_LIBRARY_PATH - Static variable in class de.tilman_neumann.util.ConfigUtil
-
Java library path
- JAVA_TMP_DIR - Static variable in class de.tilman_neumann.util.ConfigUtil
-
Java temp directory
K
- KnuthSchroeppel - Class in de.tilman_neumann.jml.factor.siqs
-
Computation of the Knuth-Schroeppel multiplier k for the quadratic sieve.
- KnuthSchroeppel() - Constructor for class de.tilman_neumann.jml.factor.siqs.KnuthSchroeppel
- KnuthSchroeppel_CFrac - Class in de.tilman_neumann.jml.factor.cfrac
-
Computation of Knuth-Schroeppel multipliers for CFrac following [Pomerance 1983: "Implementation of the continued fraction integer factoring algorithm"].
- KnuthSchroeppel_CFrac() - Constructor for class de.tilman_neumann.jml.factor.cfrac.KnuthSchroeppel_CFrac
- kroneckerSymbol(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.JacobiSymbol
-
The Kronecker symbol K(a|m) generalizes the Jacobi symbol J(a|m) for arbitrary natural numbers m.
L
- last() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- lastPrime - Variable in class de.tilman_neumann.jml.primes.PrimeGapTest.StackElement
- lcm(BigInteger[]) - Static method in class de.tilman_neumann.jml.gcd.Gcd
-
Least common multiple of k arguments n1, n2, ..., nk.
- lcm(BigInteger, BigInteger) - Static method in class de.tilman_neumann.jml.gcd.Gcd
-
Least common multiple of two arguments.
- lcm(Collection<BigInteger>) - Static method in class de.tilman_neumann.jml.gcd.Gcd
-
Least common multiple of k arguments n1, n2, ..., nk.
- LegendreSymbol - Class in de.tilman_neumann.jml.modular
-
Computation of the Legendre symbol using Eulers formula.
- LegendreSymbol() - Constructor for class de.tilman_neumann.jml.modular.LegendreSymbol
- Lehman_AnalyzeCongruences - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the moduli of a-values that help the Lehman algorithm to find factors.
- Lehman_AnalyzeCongruences() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences
- Lehman_AnalyzeCongruences2 - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze a-values that help the Lehman algorithm to find factors, modulo powers of 2.
- Lehman_AnalyzeCongruences2() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences2
- Lehman_AnalyzeKFactoringMostN - Class in de.tilman_neumann.jml.factor.lehman
-
Try to find the best k-sequence.
- Lehman_AnalyzeKFactoringMostN() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringMostN
- Lehman_AnalyzeKFactoringSameN - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the frequency with which different k find a factor.
- Lehman_AnalyzeKFactoringSameN() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringSameN
- Lehman_AnalyzeKMods - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the frequency with which different k-moduli % MOD find a factor.
- Lehman_AnalyzeKMods(int) - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKMods
- Lehman_AnalyzeKProgressions - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the frequency with which different arithmetic progressions (k = start + step*m) find a factor.
- Lehman_AnalyzeKProgressions() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions
- Lehman_AnalyzeKProgressions2 - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the frequency with which different arithmetic progressions (k = start + step*m) find a factor.
- Lehman_AnalyzeKProgressions2() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions2
- Lehman_AnalyzeKStructure - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze the frequency with which different k find a factor.
- Lehman_AnalyzeKStructure() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKStructure
- Lehman_AnalyzeModPowersOf2 - Class in de.tilman_neumann.jml.factor.lehman
-
Analyze quadratic residues of a^2 - 4kN (mod m) for m=2, 4, 8, 16, 32, 64,...
- Lehman_AnalyzeModPowersOf2() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeModPowersOf2
- Lehman_AnalyzeSpecialArguments - Class in de.tilman_neumann.jml.factor.lehman
-
Lehman analyzer that finds the correct k- and a-values of inputs other algorithms can not cope with.
- Lehman_AnalyzeSpecialArguments() - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeSpecialArguments
- Lehman_CustomKOrder - Class in de.tilman_neumann.jml.factor.lehman
-
A variant of Lehman's algorithm that allows to arrange the k's in arrays of different "performance levels".
- Lehman_CustomKOrder(boolean) - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_CustomKOrder
-
Full constructor.
- Lehman_Fast - Class in de.tilman_neumann.jml.factor.lehman
-
Fast implementation of Lehman's factor algorithm.
- Lehman_Fast(boolean) - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_Fast
-
Full constructor.
- Lehman_Simple - Class in de.tilman_neumann.jml.factor.lehman
-
Simple implementation of Lehmans factor algorithm, following https://programmingpraxis.com/2017/08/22/lehmans-factoring-algorithm/, using fast inverse trial division.
- Lehman_Simple(boolean) - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_Simple
-
Full constructor.
- Lehman_Smith - Class in de.tilman_neumann.jml.factor.lehman
-
An attempt to reproduce Warren D.
- Lehman_Smith(boolean) - Constructor for class de.tilman_neumann.jml.factor.lehman.Lehman_Smith
-
Full constructor.
- ln(BigDecimal, Precision) - Static method in class de.tilman_neumann.jml.transcendental.Ln
- ln(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.transcendental.Ln
-
Compute the natural logarithm of x, for x>0.
- Ln - Class in de.tilman_neumann.jml.transcendental
-
Implementation of the natural logarithm function for BigDecimals.
- Ln() - Constructor for class de.tilman_neumann.jml.transcendental.Ln
- ln2(Scale) - Static method in class de.tilman_neumann.jml.transcendental.Ln
-
Faster ln2 implementation, computing the series expansion of 2^(1/k) for some optimally chosen k.
- lnPMultiplier - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
multiplier to scale ln(p) values to the chosen log base
- LOG10_TO_LOG2_MULTIPLIER - Static variable in class de.tilman_neumann.jml.precision.Magnitude
-
Multiplier to convert log10-values to log2-values.
- LOG2_TO_LOG10_MULTIPLIER - Static variable in class de.tilman_neumann.jml.precision.Magnitude
-
Multiplier to convert log2-values to log10-values.
- logPArray - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
log-values of the primes or powers
- logPower - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- longValue() - Method in class de.tilman_neumann.jml.base.BigRational
- longValue() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- LucasTest - Class in de.tilman_neumann.jml.primes.probable
-
Lucas probable prime tests.
- LucasTest() - Constructor for class de.tilman_neumann.jml.primes.probable.LucasTest
M
- Magnitude - Class in de.tilman_neumann.jml.precision
- Magnitude() - Constructor for class de.tilman_neumann.jml.precision.Magnitude
- main(String[]) - Static method in class de.tilman_neumann.jml.base.BigIntConverter
- main(String[]) - Static method in class de.tilman_neumann.jml.base.Uint128
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.base.UnsignedBigIntTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.BinarySearch
- main(String[]) - Static method in class de.tilman_neumann.jml.ChebyshevPolynomials
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.CollatzSequenceTest
- main(String[]) - Static method in class de.tilman_neumann.jml.combinatorics.Binomial
-
Test
- main(String[]) - Static method in class de.tilman_neumann.jml.combinatorics.Factorial
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.combinatorics.FallingFactorial
-
Test
- main(String[]) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
-
Tests.
- main(String[]) - Static method in class de.tilman_neumann.jml.Divisors
-
Tests.
- main(String[]) - Static method in class de.tilman_neumann.jml.EgyptianFractionsTriangle
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.BatchFactorizer
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.cfrac.CFrac
-
Standalone test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
-
Run with command-line arguments or console input (if no command-line arguments are given).
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethodTest
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm63
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.FactorizerTest
-
Test factor algorithms for sets of factor arguments of growing size and report timings after each set.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeCongruences
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_Fast
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_Fast2Mult
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_Simple
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_Squarefree
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.hart.Hart_TDiv_Race2
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.IsSqrt_Test
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences2
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringMostN
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKFactoringSameN
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKMods
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKProgressions2
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeKStructure
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeModPowersOf2
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeSpecialArguments
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_CustomKOrder
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_Fast
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.lehman.Lehman_Smith
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery63
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.psiqs.PSIQS_U
-
Stand-alone test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.siqs.poly.BParamTest
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.siqs.SIQS_Small
-
Stand-alone test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.siqs.SIQS
-
Stand-alone test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.squfof.SquFoF31
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.squfof.SquFoF63
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.TestsetGenerator
-
A simple main function to generate hard semi-primes.
- main(String[]) - Static method in class de.tilman_neumann.jml.factor.TestsetGeneratorTest
- main(String[]) - Static method in class de.tilman_neumann.jml.FermatCatalanConjectureTest
- main(String[]) - Static method in class de.tilman_neumann.jml.HarmonicNumbers
- main(String[]) - Static method in class de.tilman_neumann.jml.modular.JacobiTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.modular.ModularSqrtTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.MoebiusFunction
-
Tests.
- main(String[]) - Static method in class de.tilman_neumann.jml.partitions.IntegerPartitionGenerator
-
Test
- main(String[]) - Static method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Test
- main(String[]) - Static method in class de.tilman_neumann.jml.partitions.MpiPartitionGeneratorTest
-
Test
- main(String[]) - Static method in class de.tilman_neumann.jml.partitions.PrimePowers_DefaultImpl
-
Check relationship between set of divisors and powermap.
- main(String[]) - Static method in class de.tilman_neumann.jml.powers.PurePowerTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBoundsTest
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBoundsTest
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.exact.SegmentedSieve
-
Test performance without load caused by processPrime().
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.exact.SieveTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.exact.SimpleSieve
-
Test performance without load caused by processPrime().
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.exact.SSOZJ
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.PrimeCountsBetweenSquares
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.PrimeGapTest
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.probable.NextProbablePrimeTest
-
Stand-alone test.
- main(String[]) - Static method in class de.tilman_neumann.jml.primes.RiemannHypothesisTest
- main(String[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowNTest01
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowNTest02
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowNTest
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowNTest01
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowNTest02
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.roots.Roots
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.roots.RootsReal
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.roots.SqrtInt
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.roots.SqrtReal
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.sequence.SquarefreeSequence
- main(String[]) - Static method in class de.tilman_neumann.jml.sequence.SquarefreeSequence63
- main(String[]) - Static method in class de.tilman_neumann.jml.smooth.CANEntry
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.SumOf4Squares
-
A test of the hypothesis that A023105(2^n) == 2 + the number of entries of A004215 that are less than 2^n, for n>0.
- main(String[]) - Static method in class de.tilman_neumann.jml.transcendental.Agm
- main(String[]) - Static method in class de.tilman_neumann.jml.transcendental.EulerConstant
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.transcendental.Exp
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.transcendental.Ln
-
Test.
- main(String[]) - Static method in class de.tilman_neumann.jml.transcendental.Pi
-
Test.
- MatrixRow - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
A congruence used by the matrix solver where the elements have been mapped to integer indices.
- MatrixRow(IndexSet, IndexSet) - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
-
Full constructor.
- matrixSolver - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
-
The solver used for smooth congruence equation systems.
- MatrixSolver - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
Base implementation for a congruence equation system (the "LinAlg phase matrix") solver.
- MatrixSolver() - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
- MatrixSolver01_Gauss - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
A simple congruence equation system solver, doing Gaussian elimination.
- MatrixSolver01_Gauss() - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver01_Gauss
- MatrixSolver02_BlockLanczos - Class in de.tilman_neumann.jml.factor.base.matrixSolver
-
An adapter for Dario Alpern's Block-Lanczos solver.
- MatrixSolver02_BlockLanczos() - Constructor for class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver02_BlockLanczos
- max(Collection<Integer>) - Static method in class de.tilman_neumann.jml.base.IntCollectionUtil
-
Returns the maximum value of the given non-negative integer collection.
- maxNextPart(Mpi, Mpi) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- maxNextPart(Mpi, Mpi) - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Special operation computing the biggest allowed subvalue of this that is not greater than lastPart and not greater than this-firstPart.
- maxQRest - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
maximal Q_rest accepted as smooth candidate
- maxQRestExponent - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- MillerRabinTest - Class in de.tilman_neumann.jml.primes.probable
-
Miller-Rabin probable prime test.
- MillerRabinTest() - Constructor for class de.tilman_neumann.jml.primes.probable.MillerRabinTest
- Mmult - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- mod(int) - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Compute the remainder of this modulo divisor.
- MODERATE_SEMIPRIMES - de.tilman_neumann.jml.factor.TestNumberNature
-
Odd semiprimes N=a*b with min(a,b) >= cbrt(N).
- modPow(int, int, int) - Method in class de.tilman_neumann.jml.modular.ModularPower
-
Computes a^b (mod c) for all-int arguments.
- modPow(BigInteger, int, int) - Method in class de.tilman_neumann.jml.modular.ModularPower
-
Computes a^b (mod c) for
a
BigInteger,b, c
int. - modularInverse(int, int) - Method in class de.tilman_neumann.jml.gcd.EEA31
-
Slightly faster modular inverse initializing variables with first iteration and needing one step less at the end.
- modularInverse(long, long) - Method in class de.tilman_neumann.jml.gcd.EEA63
-
Compute the modular inverse x of a mod p, i.e.
- modularInverse_v1(int, int) - Method in class de.tilman_neumann.jml.gcd.EEA31
-
Computes only the modular inverse a = (1/x) mod y.
- modularInverse_v1(long, long) - Method in class de.tilman_neumann.jml.gcd.EEA63
-
Computes only the modular inverse a = (1/x) mod y.
- modularInverse_v2(long, long) - Method in class de.tilman_neumann.jml.gcd.EEA63
-
Slightly faster modular inverse initializing variables with first iteration and needing one step less at the end.
- ModularPower - Class in de.tilman_neumann.jml.modular
-
Modular power.
- ModularPower() - Constructor for class de.tilman_neumann.jml.modular.ModularPower
- modularSqrt(int, int) - Method in class de.tilman_neumann.jml.modular.ModularSqrt31
-
Compute the modular sqrt t with t^2 == n (mod p).
- modularSqrt(BigInteger, int) - Method in class de.tilman_neumann.jml.modular.ModularSqrt
-
Compute the modular sqrt t with t^2 == n (mod p).
- modularSqrt(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.ModularSqrt_BB
-
Compute the modular sqrt t with t^2 == n (mod p).
- ModularSqrt - Class in de.tilman_neumann.jml.modular
-
Compute modular sqrts t with t^2 == n (mod p) and u with u^2 == n (mod p^e) using Tonelli-Shanks' algorithm.
- ModularSqrt() - Constructor for class de.tilman_neumann.jml.modular.ModularSqrt
- ModularSqrt_BB - Class in de.tilman_neumann.jml.modular
-
Compute modular sqrts t with t^2 == n (mod p) and u with u^2 == n (mod p^e) using Tonelli-Shanks' algorithm.
- ModularSqrt_BB() - Constructor for class de.tilman_neumann.jml.modular.ModularSqrt_BB
- ModularSqrt31 - Class in de.tilman_neumann.jml.modular
-
Compute modular sqrts t with t^2 == n (mod p) and u with u^2 == n (mod p^e) using Tonelli-Shanks' algorithm.
- ModularSqrt31() - Constructor for class de.tilman_neumann.jml.modular.ModularSqrt31
- modularSqrtModPower(int, int, int, int) - Method in class de.tilman_neumann.jml.modular.ModularSqrt31
-
General solution of u^2 == n (mod p^exponent), well explained in [http://mathoverflow.net/questions/52081/is-there-an-efficient-algorithm-for-finding-a-square-root-modulo-a-prime-power, Gottfried Barthel].
- modularSqrtModPower(BigInteger, int, int, int) - Method in class de.tilman_neumann.jml.modular.ModularSqrt
-
General solution of u^2 == n (mod p^exponent), well explained in [http://mathoverflow.net/questions/52081/is-there-an-efficient-algorithm-for-finding-a-square-root-modulo-a-prime-power, Gottfried Barthel].
- modularSqrtModPower(BigInteger, BigInteger, BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.ModularSqrt_BB
-
General solution of u^2 == n (mod p^exponent), well explained in [http://mathoverflow.net/questions/52081/is-there-an-efficient-algorithm-for-finding-a-square-root-modulo-a-prime-power, Gottfried Barthel].
- modularSqrtModSquare_v01(BigInteger, BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.ModularSqrt_BB
-
Simplest algorithm to compute solutions u of u^2 == n (mod p^2).
- modularSqrtModSquare_v02(BigInteger, BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.modular.ModularSqrt_BB
-
A faster version to compute solutions u of u^2 == n (mod p^2), doing modular arithmetics (mod p) only, which is an application of lifting via Hensels lemma.
- ModularSqrtsEngine - Class in de.tilman_neumann.jml.factor.siqs
-
Engine to compute the smallest modular sqrts for all elements of the prime base.
- ModularSqrtsEngine() - Constructor for class de.tilman_neumann.jml.factor.siqs.ModularSqrtsEngine
- ModularSqrtTest - Class in de.tilman_neumann.jml.modular
- ModularSqrtTest() - Constructor for class de.tilman_neumann.jml.modular.ModularSqrtTest
- moebius(BigInteger) - Static method in class de.tilman_neumann.jml.MoebiusFunction
-
Computes the value of the Moebius function at n.
- MoebiusFunction - Class in de.tilman_neumann.jml
-
Implementations of the Moebius function.
- MontgomeryMult - Class in de.tilman_neumann.jml.factor.ecm
-
Montgomery multiplication, extracted from Dario Alpern's Ecm program.
- MontgomeryMult(int[], int) - Constructor for class de.tilman_neumann.jml.factor.ecm.MontgomeryMult
- montMul63(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm63
-
Montgomery multiplication of a*b mod n with regard to R=2^63.
- montMul63(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
-
Montgomery multiplication of a*b mod n with regard to R=2^63.
- montMul64(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline
-
Montgomery multiplication of a*b mod n.
- montMul64(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
-
Montgomery multiplication of a*b mod n.
- montMul64(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64
-
Montgomery multiplication of a*b mod n.
- montMul64(long, long, long, long) - Static method in class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
-
Montgomery multiplication of a*b mod n.
- montSqr64(long, long, long) - Static method in class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
-
Montgomery square of a mod n.
- Mpi - Interface in de.tilman_neumann.jml.partitions
-
A multipartite number like [1,3,4,2,0,1].
- Mpi_IntegerArrayImpl - Class in de.tilman_neumann.jml.partitions
-
int[] implementation of a multipartite number like [1,3,4,2,0,1].
- Mpi_IntegerArrayImpl(int) - Constructor for class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
-
Constructor for zero-initialized mpi with dim entries.
- Mpi_IntegerArrayImpl(int[]) - Constructor for class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
-
Constructor from element array, with element copy.
- Mpi_IntegerArrayImpl(Mpi) - Constructor for class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
-
Copy constructor.
- Mpi_IntegerArrayImpl(String) - Constructor for class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
-
Constructor from a comma-separated string of values.
- Mpi_IntegerArrayImpl(Collection<Integer>) - Constructor for class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
-
Constructor from value collection.
- MpiPartition - Class in de.tilman_neumann.jml.partitions
-
A partition of a multipartite integer.
- MpiPartition() - Constructor for class de.tilman_neumann.jml.partitions.MpiPartition
- MpiPartition(Mpi[]) - Constructor for class de.tilman_neumann.jml.partitions.MpiPartition
- MpiPartitionGenerator - Class in de.tilman_neumann.jml.partitions
-
A generator for the additive partitions of multipartite numbers.
- MpiPartitionGenerator(Mpi) - Constructor for class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Complete constructor for a generator of the partitions of the multivariate number q.
- MpiPartitionGeneratorTest - Class in de.tilman_neumann.jml.partitions
- MpiPartitionGeneratorTest() - Constructor for class de.tilman_neumann.jml.partitions.MpiPartitionGeneratorTest
- MpiPowerMap - Class in de.tilman_neumann.jml.partitions
-
A map from all "subvalues" s of a multipartite number q with 1
- mul(int[], int[], int[]) - Method in class de.tilman_neumann.jml.factor.ecm.MontgomeryMult
- mul63(long, long) - Static method in class de.tilman_neumann.jml.base.Uint128
Multiplication of unsigned 63 bit integers, following https://stackoverflow.com/questions/18859207/high-bits-of-long-multiplication-in-java.- mul64(long, long) - Static method in class de.tilman_neumann.jml.base.Uint128
Multiplication of unsigned 64 bit integers with simplified carry recognition.- mul64_getLow(long, long) - Static method in class de.tilman_neumann.jml.base.Uint128
Computes the low part of the product of two unsigned 64 bit integers.- mul64_v1(long, long) - Static method in class de.tilman_neumann.jml.base.Uint128
Multiplication of unsigned 64 bit integers, following https://stackoverflow.com/questions/18859207/high-bits-of-long-multiplication-in-java.- mulPow2(BigDecimal, int) - Static method in class de.tilman_neumann.jml.powers.Pow2
Multiplication with the n.th power of 2.- multinomial(int[]) - Static method in class de.tilman_neumann.jml.combinatorics.Multinomial
Multinomial coefficient.- Multinomial - Class in de.tilman_neumann.jml.combinatorics
Multinomial coefficient implementations.- Multinomial() - Constructor for class de.tilman_neumann.jml.combinatorics.Multinomial
- multiplierFinder - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- multiply(int) - Method in class de.tilman_neumann.jml.precision.Precision
- multiply(int) - Method in class de.tilman_neumann.jml.precision.Scale
- multiply(BigIntPoly) - Method in class de.tilman_neumann.jml.base.BigIntPoly
Multiply by another polynomial.- multiply(BigRational) - Method in class de.tilman_neumann.jml.base.BigRational
Computes the product of this and the argument.- multiply(BigDecimal, long) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
Computes the product a*b without precision loss.- multiply(BigDecimal, BigRational, Precision) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
Computes the product of a and b.
Precision is the natural accuracy measure for multiplications because for each argument, each piece of it (bit, digit, ...) makes its own independent contribution to the result precision.- multiply(BigDecimal, BigRational, Scale) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
- multiply(BigDecimal, BigInteger) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
Multiplication without precision loss.- multiply(BigInteger) - Method in class de.tilman_neumann.jml.base.BigRational
Computes the product of this and the argument.- Multiset_HashMapImpl<T> - Class in de.tilman_neumann.util
A set of unsorted elements with multiple occurences.- Multiset_HashMapImpl() - Constructor for class de.tilman_neumann.util.Multiset_HashMapImpl
Constructor for an empty multiset.- Multiset_HashMapImpl(Collection<T>) - Constructor for class de.tilman_neumann.util.Multiset_HashMapImpl
Constructor from an ordinary collection.- Multiset_HashMapImpl(Multiset<T>) - Constructor for class de.tilman_neumann.util.Multiset_HashMapImpl
Copy constructor.- Multiset_HashMapImpl(T[]) - Constructor for class de.tilman_neumann.util.Multiset_HashMapImpl
Constructor from a value array.N
- N - Variable in class de.tilman_neumann.jml.factor.base.FactorArguments
-
The number to factor
- NBits - Variable in class de.tilman_neumann.jml.factor.base.FactorArguments
-
The number of bits of N
- negate() - Method in class de.tilman_neumann.jml.base.BigRational
- next() - Method in interface de.tilman_neumann.jml.partitions.Generator
- next() - Method in class de.tilman_neumann.jml.partitions.IntegerPartitionGenerator
-
Compute the next partition of the input.
- next() - Method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Compute the next partition of the multipartite input.
- next() - Method in interface de.tilman_neumann.jml.sequence.NumberSequence
- next() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence
- next() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence63
- next() - Method in class de.tilman_neumann.jml.smooth.CANIterator
- next() - Method in class de.tilman_neumann.jml.smooth.SHCNIterator
- nextInt(int, int) - Method in class de.tilman_neumann.jml.base.Rng
-
Creates a random integer from the uniform distribution U[min, max-1].
- nextLong(long) - Method in class de.tilman_neumann.jml.base.Rng
-
Creates a random long from the uniform distribution U[0, max-1].
- nextLong(long, long) - Method in class de.tilman_neumann.jml.base.Rng
-
Creates a random long from the uniform distribution U[min, max-1].
- nextPolynomial() - Method in class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
-
Compute a new polynomial.
- nextProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.BPSWTest
- nextProbablePrime(BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.PrPTest
- NextProbablePrimeTest - Class in de.tilman_neumann.jml.primes.probable
-
Performance test of nextProbablePrime() implementations.
- NextProbablePrimeTest() - Constructor for class de.tilman_neumann.jml.primes.probable.NextProbablePrimeTest
- nextStirling1Diag(BigInteger[], int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
- NoPowerFinder - Class in de.tilman_neumann.jml.factor.siqs.powers
-
Dummy implementation of PowerFinder that ignores powers.
- NoPowerFinder() - Constructor for class de.tilman_neumann.jml.factor.siqs.powers.NoPowerFinder
- normalize() - Method in class de.tilman_neumann.jml.base.BigRational
- NthPrimeUpperBounds - Class in de.tilman_neumann.jml.primes.bounds
-
Bounds for the n.th prime p(n).
- NthPrimeUpperBoundsTest - Class in de.tilman_neumann.jml.primes.bounds
-
Test of upper bound estimates for the n.th prime.
- NthPrimeUpperBoundsTest() - Constructor for class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBoundsTest
- NUM_PRIMES_FOR_31_BIT_TDIV - Static variable in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
the number of primes needed to factor any int <= 2^31 - 1 using trial division
- NUMBER_OF_PROCESSORS - Static variable in class de.tilman_neumann.util.ConfigUtil
-
number of processors to use for parallel implementations
- NumberGrid<U> - Class in de.tilman_neumann.jml.base
-
A two-dimensional number grid with pretty-print method.
- NumberGrid(String, int, int, String, int, int) - Constructor for class de.tilman_neumann.jml.base.NumberGrid
-
Full constructor with all options.
- NumberGrid(String, int, String, int) - Constructor for class de.tilman_neumann.jml.base.NumberGrid
-
Simplified constructor with offsets 1.
- numberOfFactorizationsOf(BigInteger) - Static method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Computes the number of essentially different prime factorizations of n.
- numberOfPartitionsOf(Mpi) - Static method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Counts the number of partitions of the given multipartite integer.
- numberOfThreads - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- NumberSequence<T> - Interface in de.tilman_neumann.jml.sequence
-
Interface for number sequences of type T.
O
- of(double) - Static method in class de.tilman_neumann.jml.precision.Magnitude
- of(double) - Static method in class de.tilman_neumann.jml.precision.Precision
- of(double) - Static method in class de.tilman_neumann.jml.precision.Scale
- of(float) - Static method in class de.tilman_neumann.jml.precision.Magnitude
- of(float) - Static method in class de.tilman_neumann.jml.precision.Precision
- of(float) - Static method in class de.tilman_neumann.jml.precision.Scale
- of(long) - Static method in class de.tilman_neumann.jml.precision.Magnitude
- of(BigRational) - Static method in class de.tilman_neumann.jml.precision.Magnitude
- of(BigDecimal) - Static method in class de.tilman_neumann.jml.precision.Magnitude
- of(BigDecimal) - Static method in class de.tilman_neumann.jml.precision.Precision
-
The precision of a BigDecimal, with 0 for zero values.
- of(BigDecimal) - Static method in class de.tilman_neumann.jml.precision.Scale
- of(BigInteger) - Static method in class de.tilman_neumann.jml.precision.Magnitude
-
Gives the absolute size of n in decimal digits.
- on(T) - Method in interface de.tilman_neumann.jml.primes.exact.SSOZJ.Callback
- ONE - Static variable in class de.tilman_neumann.jml.base.BigRational
- ONE_HALF - Static variable in class de.tilman_neumann.jml.base.BigRational
- org.matheclipse.gpl.numbertheory - package org.matheclipse.gpl.numbertheory
P
- p - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- Pair<U,V> - Class in de.tilman_neumann.util
-
A simple utility class combining two values of arbitrary types to one object.
- Pair(U, V) - Constructor for class de.tilman_neumann.util.Pair
- pArray - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
powers, e.g.
- Partial - Class in de.tilman_neumann.jml.factor.base.congruence
-
Base class for partial congruences.
- Partial(BigInteger, SortedIntegerArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Partial
-
Full constructor.
- Partial_1Large - Class in de.tilman_neumann.jml.factor.base.congruence
-
A partial congruence having 1 large factor.
- Partial_1Large(BigInteger, SortedIntegerArray, long) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Partial_1Large
-
Full constructor.
- Partial_2Large - Class in de.tilman_neumann.jml.factor.base.congruence
-
A partial congruence having 2 distinct large factors.
- Partial_2Large(BigInteger, SortedIntegerArray, long, long) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Partial_2Large
-
Full constructor.
- Partial_nLarge - Class in de.tilman_neumann.jml.factor.base.congruence
-
A partial congruence having an arbitrary number of large factors.
- Partial_nLarge(BigInteger, SortedIntegerArray, SortedLongArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Partial_nLarge
-
Full constructor.
- PartialSolver - Class in de.tilman_neumann.jml.factor.base.congruence
-
A Gaussian solver used to find smooth from partial relations.
- PartialSolver() - Constructor for class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
- partitionsOf(int) - Static method in class de.tilman_neumann.jml.partitions.IntegerPartitionGenerator
-
Computes the partitions of the given number.
- partitionsOf(Mpi) - Static method in class de.tilman_neumann.jml.partitions.MpiPartitionGenerator
-
Computes the partitions of the given multipartite number.
- PATH_SEPARATOR - Static variable in class de.tilman_neumann.util.ConfigUtil
-
Path separator used on this OS.
- pi(Scale) - Static method in class de.tilman_neumann.jml.transcendental.Pi
-
Compute Pi using the approximation formula found by Plouffe and the Borwein brothers also used in mpfr.
- Pi - Class in de.tilman_neumann.jml.transcendental
-
Computations of Pi = 3.1415...
- Pi() - Constructor for class de.tilman_neumann.jml.transcendental.Pi
- pinvArrayD - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
1/p for all primes/powers
- pinvArrayL - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
2^32 / p for all primes/powers
- pinvD - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- pinvL - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- pMax - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
the largest prime in the prime base
- pMin - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
the smallest prime used for sieving.
- pMinIndex - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
-
the index of the smallest prime used for sieving.
- PollardRho - Class in de.tilman_neumann.jml.factor.pollardRho
-
From: http://www.cs.princeton.edu/introcs/79crypto/PollardRho.java (INTRODUCTION TO COMPUTER SCIENCE by Robert Sedgewick and Kevin Wayne) Pollards Rho method.
- PollardRho() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRho
- PollardRho_ProductGcd - Class in de.tilman_neumann.jml.factor.pollardRho
-
Pollard's Rho algorithm improved by doing the GCD on products.
- PollardRho_ProductGcd() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRho_ProductGcd
- PollardRho31 - Class in de.tilman_neumann.jml.factor.pollardRho
-
31-bit implementation of Pollard' Rho method.
- PollardRho31() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRho31
- PollardRhoBrent - Class in de.tilman_neumann.jml.factor.pollardRho
-
Brents's improvement of Pollard's Rho algorithm, following [Richard P.
- PollardRhoBrent() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent
- PollardRhoBrent31 - Class in de.tilman_neumann.jml.factor.pollardRho
-
Brents's improvement of Pollard's Rho algorithm, following [Richard P.
- PollardRhoBrent31() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31
- PollardRhoBrentMontgomery63 - Class in de.tilman_neumann.jml.factor.pollardRho
-
Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.
- PollardRhoBrentMontgomery63() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery63
- PollardRhoBrentMontgomery64 - Class in de.tilman_neumann.jml.factor.pollardRho
-
Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.
- PollardRhoBrentMontgomery64() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomery64
- PollardRhoBrentMontgomeryR64Mul63 - Class in de.tilman_neumann.jml.factor.pollardRho
-
Brents's improvement of Pollard's Rho algorithm using Montgomery multiplication.
- PollardRhoBrentMontgomeryR64Mul63() - Constructor for class de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrentMontgomeryR64Mul63
- polyGenerator - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- PolyReport - Class in de.tilman_neumann.jml.factor.siqs.poly
-
Reports about a polynomial generator.
- PolyReport(int, int, long, long, long, long, long, long) - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.PolyReport
- pow(BigDecimal, int, Scale) - Static method in class de.tilman_neumann.jml.powers.Pow
- pow(BigDecimal, BigInteger, Precision) - Static method in class de.tilman_neumann.jml.powers.Pow
-
Power function for large integer exponents (also negative)
- Pow - Class in de.tilman_neumann.jml.powers
- Pow() - Constructor for class de.tilman_neumann.jml.powers.Pow
- pow2(int) - Static method in class de.tilman_neumann.jml.powers.Pow2
-
Power of 2 with integer exponent.
- Pow2 - Class in de.tilman_neumann.jml.powers
- Pow2() - Constructor for class de.tilman_neumann.jml.powers.Pow2
- power - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- PowerEntry - Class in de.tilman_neumann.jml.factor.siqs.powers
-
Auxiliary class that allows to get the powers sorted bottom-up by the power value.
- PowerEntry(int, int, int, int, byte) - Constructor for class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- powerFinder - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- PowerFinder - Interface in de.tilman_neumann.jml.factor.siqs.powers
- PowerOfSmallPrimesFinder - Class in de.tilman_neumann.jml.factor.siqs.powers
-
Algorithm to find the first powers of all p
- PowerOfSmallPrimesFinder() - Constructor for class de.tilman_neumann.jml.factor.siqs.powers.PowerOfSmallPrimesFinder
- powJavaTrunc(BigDecimal, int, Precision) - Static method in class de.tilman_neumann.jml.powers.Pow
- Precision - Class in de.tilman_neumann.jml.precision
Relative precision for BigDecimal operations.- prime - Variable in class de.tilman_neumann.jml.primes.PrimeGapTest.StackElement
- PRIME_FACTORIZATION - de.tilman_neumann.jml.factor.TestMode
Find the prime factorization of a given N.- PrimeBaseGenerator - Class in de.tilman_neumann.jml.factor.base
Prime base generator.- PrimeBaseGenerator() - Constructor for class de.tilman_neumann.jml.factor.base.PrimeBaseGenerator
- PrimeCountsBetweenSquares - Class in de.tilman_neumann.jml.primes
Find #primes between consecutive squares.- PrimeCountsBetweenSquares(long) - Constructor for class de.tilman_neumann.jml.primes.PrimeCountsBetweenSquares
- PrimeCountUpperBounds - Class in de.tilman_neumann.jml.primes.bounds
Bounds for the prime counting function pi(x) = number of primes in (0, x].- PrimeCountUpperBoundsTest - Class in de.tilman_neumann.jml.primes.bounds
Test of upper bound estimates for the prime count function.- PrimeCountUpperBoundsTest() - Constructor for class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBoundsTest
- primeFactors - Variable in class de.tilman_neumann.jml.factor.base.FactorResult
factors that are at least probable prime- PrimeGapTest - Class in de.tilman_neumann.jml.primes
Find primes with relatively large prime gaps, say ratios p(i)/p(i-1) > p(k)/p(k-1) for all k > i.- PrimeGapTest(long) - Constructor for class de.tilman_neumann.jml.primes.PrimeGapTest
- PrimeGapTest.StackElement - Class in de.tilman_neumann.jml.primes
- PrimePowers - Interface in de.tilman_neumann.jml.partitions
Product of primes implemented as an multipartite integer.- PrimePowers_DefaultImpl - Class in de.tilman_neumann.jml.partitions
- primes - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
The prime base- processNullVector(Set<AQPair>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
- processPrime(long) - Method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBoundsTest
Fallback method: Receives new primes from the sieve and checks the upper bound estimates for the n.th prime p(n).- processPrime(long) - Method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBoundsTest
Fallback method: Receives new primes from the sieve and checks the upper bound estimates for the prime count function.- processPrime(long) - Method in class de.tilman_neumann.jml.primes.exact.AutoExpandingPrimesArray
Fallback method: Receives new primes from the sieve and stores them in the array.- processPrime(long) - Method in class de.tilman_neumann.jml.primes.exact.CollectingCallback
- processPrime(long) - Method in class de.tilman_neumann.jml.primes.exact.CountingCallback
- processPrime(long) - Method in interface de.tilman_neumann.jml.primes.exact.SieveCallback
- processPrime(long) - Method in class de.tilman_neumann.jml.primes.PrimeCountsBetweenSquares
- processPrime(long) - Method in class de.tilman_neumann.jml.primes.PrimeGapTest
- product(Collection<BigInteger>) - Static method in class de.tilman_neumann.jml.base.BigIntCollectionUtil
- PROJECT_ROOT - Static variable in class de.tilman_neumann.util.ConfigUtil
The root directory of the current project.- PrPTest - Class in de.tilman_neumann.jml.primes.probable
A probable prime test for arbitrary precision numbers.- PrPTest() - Constructor for class de.tilman_neumann.jml.primes.probable.PrPTest
- PSIQS - Class in de.tilman_neumann.jml.factor.psiqs
Multi-threaded SIQS using Sieve03g.- PSIQS(float, float, Integer, Float, int, PowerFinder, MatrixSolver) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQS
Standard constructor.- PSIQS_SBH_U - Class in de.tilman_neumann.jml.factor.psiqs
Multi-threaded SIQS using the single block hybrid sieve.- PSIQS_SBH_U(float, float, Integer, Float, int, int, PowerFinder, MatrixSolver) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQS_SBH_U
Standard constructor.- PSIQS_U - Class in de.tilman_neumann.jml.factor.psiqs
Multi-threaded SIQS using Sieve03gU.- PSIQS_U(float, float, Integer, Float, int, PowerFinder, MatrixSolver) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQS_U
Standard constructor.- PSIQSBase - Class in de.tilman_neumann.jml.factor.psiqs
Multi-threaded SIQS, the fastest factor algorithm in this project.- PSIQSBase(float, float, Float, int, Integer, PowerFinder, MatrixSolver, AParamGenerator) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
Standard constructor.- PSIQSThread - Class in de.tilman_neumann.jml.factor.psiqs
A polynomial generation/sieve/trial division thread using Sieve03g.- PSIQSThread(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQSThread
Standard constructor.- PSIQSThread_SBH_U - Class in de.tilman_neumann.jml.factor.psiqs
A polynomial generation/sieve/trial division thread using the single block hybrid sieve.- PSIQSThread_SBH_U(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, int, AParamGenerator, CongruenceCollectorParallel, int) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQSThread_SBH_U
Standard constructor.- PSIQSThread_U - Class in de.tilman_neumann.jml.factor.psiqs
A polynomial generation/sieve/trial division thread using Sieve03gU.- PSIQSThread_U(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, CongruenceCollectorParallel, int) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQSThread_U
Standard constructor.- PSIQSThreadBase - Class in de.tilman_neumann.jml.factor.psiqs
Base class for polynomial generation/sieve/trial division threads for the parallel SIQS implementation (PSIQS).- PSIQSThreadBase(int, BigInteger, BigInteger, int, SieveParams, BaseArrays, AParamGenerator, SIQSPolyGenerator, Sieve, TDiv_QS, CongruenceCollectorParallel, int) - Constructor for class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
Standard constructor.- PurePowerTest - Class in de.tilman_neumann.jml.powers
Test for pure powers (with exponent >= 2).- PurePowerTest() - Constructor for class de.tilman_neumann.jml.powers.PurePowerTest
- PurePowerTest.Result - Class in de.tilman_neumann.jml.powers
Q
- QuadraticResidues - Class in de.tilman_neumann.jml.quadraticResidues
-
Methods to generate quadratic residues or test for quadratic residuosity for general moduli m.
- QuadraticResidues() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResidues
- QuadraticResiduesMod2PowN - Class in de.tilman_neumann.jml.quadraticResidues
-
Methods to generate quadratic residues or test for quadratic residuosity modulus 2^n.
- QuadraticResiduesMod2PowN() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowN
- QuadraticResiduesMod2PowNTest01 - Class in de.tilman_neumann.jml.quadraticResidues
-
Tests of quadratic residue computations modulo general m.
- QuadraticResiduesMod2PowNTest01() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowNTest01
- QuadraticResiduesMod2PowNTest02 - Class in de.tilman_neumann.jml.quadraticResidues
-
Tests of quadratic residue computations modulo 2^n.
- QuadraticResiduesMod2PowNTest02() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod2PowNTest02
- QuadraticResiduesMod3PowN - Class in de.tilman_neumann.jml.quadraticResidues
-
Methods to generate quadratic residues or test for quadratic residuosity modulus 3^n.
- QuadraticResiduesMod3PowN() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowN
- QuadraticResiduesMod3PowNTest - Class in de.tilman_neumann.jml.quadraticResidues
-
Tests of quadratic residue computations modulo 3^n.
- QuadraticResiduesMod3PowNTest() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesMod3PowNTest
- QuadraticResiduesModBPowN - Class in de.tilman_neumann.jml.quadraticResidues
-
Methods to generate quadratic residues or test for quadratic residuosity modulus p^n, where p is an odd prime.
- QuadraticResiduesModBPowN() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowN
- QuadraticResiduesModBPowNTest01 - Class in de.tilman_neumann.jml.quadraticResidues
-
Tests of quadratic residue computations modulo P^n.
- QuadraticResiduesModBPowNTest01() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowNTest01
- QuadraticResiduesModBPowNTest02 - Class in de.tilman_neumann.jml.quadraticResidues
-
Tests of quadratic residue computations modulo P^n.
- QuadraticResiduesModBPowNTest02() - Constructor for class de.tilman_neumann.jml.quadraticResidues.QuadraticResiduesModBPowNTest02
- quickInsort(Collection<? extends T>) - Method in class de.tilman_neumann.util.SortedList
-
Sort the given collection into this.
- quickInsort(T) - Method in class de.tilman_neumann.util.SortedList
-
Sorts a single new object into this.
- QUITE_HARD_SEMIPRIMES - de.tilman_neumann.jml.factor.TestNumberNature
-
Odd semiprimes N=a*b with bitLength(min(a,b)) == bitLength(N)/2 - 1 bits.
R
- RANDOM_COMPOSITES - de.tilman_neumann.jml.factor.TestNumberNature
-
Arbitrary random composite numbers N chosen from a certain bit length.
- RANDOM_ODD_COMPOSITES - de.tilman_neumann.jml.factor.TestNumberNature
-
Random odd composite numbers N chosen from a certain bit length.
- ratio - Variable in class de.tilman_neumann.jml.primes.PrimeGapTest.StackElement
- reciprocal() - Method in class de.tilman_neumann.jml.base.BigRational
- ReflectionUtil - Class in de.tilman_neumann.util
-
Static auxiliary methods for java objects meta data.
- remove(Object) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- remove(T, int) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- removeAll(T) - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- removeSingletons(List<Partial>, Map<Long, ArrayList<Partial>>) - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
-
Remove singletons from
congruences
. - removeSingletons(List<Smooth>, Map<Integer, ArrayList<Smooth>>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
-
Remove singletons from
congruences
. - repeat(String, int) - Static method in class de.tilman_neumann.util.StringUtil
-
Concatenates string s n times.
- reset() - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
-
reset() must be called before using for a new Q.
- reset() - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
-
reset() must be called before using for a new Q.
- reset() - Method in interface de.tilman_neumann.jml.sequence.NumberSequence
-
Reset sequence so that it starts again with its first element.
- reset() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence
- reset() - Method in class de.tilman_neumann.jml.sequence.SquarefreeSequence63
- Result(int, int, int) - Constructor for class de.tilman_neumann.jml.gcd.EEA31.Result
- Result(long, long, long) - Constructor for class de.tilman_neumann.jml.gcd.EEA63.Result
- Result(SolutionArrays, int, int[]) - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter.Result
- Result(BigInteger, int) - Constructor for class de.tilman_neumann.jml.powers.PurePowerTest.Result
- RiemannHypothesisTest - Class in de.tilman_neumann.jml.primes
-
Tests Robins and Lagarias' Riemann hypothesis tests on colossally abundant numbers (CANs).
- RiemannHypothesisTest() - Constructor for class de.tilman_neumann.jml.primes.RiemannHypothesisTest
- Rng - Class in de.tilman_neumann.jml.base
-
Simple helper class to generate random numbers.
- Rng() - Constructor for class de.tilman_neumann.jml.base.Rng
- Robin1983(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Robin 1983 "for n >= 7022": My tests say it works for n >= 8601.
- RobinJacobsen(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Robin 1983 modified by D.Jacobsen for n = 6...39016 _only_.
- Roots - Class in de.tilman_neumann.jml.roots
-
i.th root of integers.
- Roots() - Constructor for class de.tilman_neumann.jml.roots.Roots
- RootsReal - Class in de.tilman_neumann.jml.roots
-
i.th root of floating point numbers.
- RootsReal() - Constructor for class de.tilman_neumann.jml.roots.RootsReal
- Rosser_Schoenfeld(long) - Static method in class de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBounds
-
Rosser, Schoenfeld: pi(x) < 1.25506*x / ln(x) for x > 1.
- RosserSchoenfeld01(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Rosser/Schoenfeld 1961 for n >= 6.
- RosserSchoenfeld02(long) - Static method in class de.tilman_neumann.jml.primes.bounds.NthPrimeUpperBounds
-
Rosser/Schoenfeld 1961 for n >= 20.
- roundInt(BigDecimal) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
-
Round x to the nearest integer.
- rStirling1(int, int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
-
Compute r-Stirling numbers of the first kind s(n,k,r)
- run() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- run() - Method in class de.tilman_neumann.jml.primes.PrimeCountsBetweenSquares
- run() - Method in class de.tilman_neumann.jml.primes.PrimeGapTest
S
- Scale - Class in de.tilman_neumann.jml.precision
-
Immutable class for precision statements in after-floating point decimal digits.
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.CombinedFactorAlgorithm
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.ecm.EllipticCurveMethod
-
Find small factors of some N.
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.FactorAlgorithm
-
Try to find at least one factor of the given args.N, which is composite and odd.
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSBase
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.siqs.SIQS_Small
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.siqs.SIQS
- searchFactors(FactorArguments, FactorResult) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv
-
Tries to find small factors of a positive, possibly large argument N by doing trial division by all primes p <= pLimit.
- SegmentedSieve - Class in de.tilman_neumann.jml.primes.exact
-
Segmented sieve of Eratosthenes based on Kim Walisch's implementation at http://primesieve.org/segmented_sieve.html
- SegmentedSieve(SieveCallback) - Constructor for class de.tilman_neumann.jml.primes.exact.SegmentedSieve
- set(int, int, BigInteger) - Method in class de.tilman_neumann.jml.base.BigIntTriangle
-
Sets the value T[n,k].
- set(int, BigInteger) - Method in class de.tilman_neumann.jml.base.BigIntPoly
-
Set a polynomial coefficient.
- set(BigInteger) - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
-
Sets this to the given BigInteger N.
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- setBParameter(BigInteger) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- setBParameter(BigInteger) - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
-
Set a new b-parameter.
- setElem(int, int) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- setElem(int, int) - Method in interface de.tilman_neumann.jml.partitions.Mpi
-
Sets the entry of the given index, with 0<=index
- setFinishNow() - Method in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- setTestLimit(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv
Set the upper limit of primes to be tested.- setTestLimit(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63
Set the upper limit of primes to be tested.- setTestLimit(int) - Method in class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
Set the upper limit of primes to be tested.- SHCNEntry - Class in de.tilman_neumann.jml.smooth
A superior highly composite number (SHCN), together with some information that was necessary to compute it.- SHCNIterator - Class in de.tilman_neumann.jml.smooth
Iterator for superior highly composite numbers 2,6,12,...- SHCNIterator() - Constructor for class de.tilman_neumann.jml.smooth.SHCNIterator
- shiftLeft(int) - Method in class de.tilman_neumann.jml.base.Uint128
Shift this 'bits' bits to the left.- shiftRight(int) - Method in class de.tilman_neumann.jml.base.Uint128
Shift this 'bits' bits to the right.- sieve - Variable in class de.tilman_neumann.jml.factor.psiqs.PSIQSThreadBase
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieve
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockHybridSieveU
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.DoubleBlockSieve
- sieve() - Method in interface de.tilman_neumann.jml.factor.siqs.sieve.Sieve
Sieve for a new set of x1, x2 solutions.- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
- sieve() - Method in class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
- sieve(long) - Method in class de.tilman_neumann.jml.primes.exact.SegmentedSieve
Generate primes.- sieve(long) - Method in class de.tilman_neumann.jml.primes.exact.SimpleSieve
Generate primes.- Sieve - Interface in de.tilman_neumann.jml.factor.siqs.sieve
Interface for sieve algorithms.- Sieve03g - Class in de.tilman_neumann.jml.factor.siqs.sieve
Advanced non-segmented sieve implementation.- Sieve03g() - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03g
- Sieve03gU - Class in de.tilman_neumann.jml.factor.siqs.sieve
Derivative of Sieve03g holding the sieve array in native memory.- Sieve03gU() - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.Sieve03gU
- sieveArraySize - Variable in class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
the size of the sieve array (per sign)- SieveCallback - Interface in de.tilman_neumann.jml.primes.exact
Segmented sieve callback interface.- SieveParams - Class in de.tilman_neumann.jml.factor.siqs.sieve
Basic parameters for the quadratic sieve.- SieveParams(BigInteger, int[], int, int, double, int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SieveParams
- SieveReport - Class in de.tilman_neumann.jml.factor.siqs.sieve
- SieveReport(long, long, long) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SieveReport
- SieveTest - Class in de.tilman_neumann.jml.primes.exact
Test performance and correctness of results of prime sieves.- SieveTest() - Constructor for class de.tilman_neumann.jml.primes.exact.SieveTest
- signum() - Method in class de.tilman_neumann.jml.base.BigRational
- SimpleSieve - Class in de.tilman_neumann.jml.factor.siqs.sieve
Simple non-segmented sieve.- SimpleSieve - Class in de.tilman_neumann.jml.primes.exact
Monolithic sieve of Eratosthenes, working only for limits < Integer.MAX_VALUE = 2^31 - 1.- SimpleSieve() - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SimpleSieve
- SimpleSieve(SieveCallback) - Constructor for class de.tilman_neumann.jml.primes.exact.SimpleSieve
- SingleBlockHybridSieve - Class in de.tilman_neumann.jml.factor.siqs.sieve
Combination of a monolithic sieve for large primes > sieveArraySize/3, and a single block sieve for p < sieveArraySize/3.- SingleBlockHybridSieve(int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieve
Full constructor.- SingleBlockHybridSieveU - Class in de.tilman_neumann.jml.factor.siqs.sieve
Combination of a monolithic sieve for large primes > sieveArraySize/3, and a single block sieve for p < sieveArraySize/3.- SingleBlockHybridSieveU(int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockHybridSieveU
Full constructor.- SingleBlockSieve - Class in de.tilman_neumann.jml.factor.siqs.sieve
Single block sieve implementation, essentially following [Wambach, Wettig 1995].- SingleBlockSieve(int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieve
Full constructor.- SingleBlockSieveU - Class in de.tilman_neumann.jml.factor.siqs.sieve
Single block sieve implementation, essentially following [Wambach, Wettig 1995].- SingleBlockSieveU(int) - Constructor for class de.tilman_neumann.jml.factor.siqs.sieve.SingleBlockSieveU
Full constructor.- SIQS - Class in de.tilman_neumann.jml.factor.siqs
Main class for single-threaded SIQS implementations.- SIQS(float, float, Integer, Float, PowerFinder, SIQSPolyGenerator, Sieve, TDiv_QS, int, MatrixSolver) - Constructor for class de.tilman_neumann.jml.factor.siqs.SIQS
Standard constructor.- SIQS_Small - Class in de.tilman_neumann.jml.factor.siqs
Single-threaded SIQS implementation used to factor the Q(x)-rests in the trial division stage of SIQS/PSIQS.- SIQS_Small(float, float, Integer, Float, SIQSPolyGenerator, int, boolean) - Constructor for class de.tilman_neumann.jml.factor.siqs.SIQS_Small
Standard constructor.- SIQSPolyGenerator - Class in de.tilman_neumann.jml.factor.siqs.poly
A generator for SIQS polynomials.- SIQSPolyGenerator() - Constructor for class de.tilman_neumann.jml.factor.siqs.poly.SIQSPolyGenerator
- size() - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- size() - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- smallestPossibleFactor - Variable in class de.tilman_neumann.jml.factor.base.FactorResult
the smallest factor that could occur in the unfactored rest, e.g.- Smooth - Interface in de.tilman_neumann.jml.factor.base.congruence
A smooth congruence.- Smooth_1LargeSquare - Class in de.tilman_neumann.jml.factor.base.congruence
A smooth congruence with 1 large factor contained as a square.- Smooth_1LargeSquare(BigInteger, SortedIntegerArray, long) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Smooth_1LargeSquare
Full constructor.- Smooth_Composite - Class in de.tilman_neumann.jml.factor.base.congruence
A smooth congruence composed from several partials.- Smooth_Composite(Set<? extends AQPair>) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
Constructor from several AQ-pairs.- Smooth_nLargeSquares - Class in de.tilman_neumann.jml.factor.base.congruence
A smooth congruence having an arbitrary number of large factors.- Smooth_nLargeSquares(BigInteger, SortedIntegerArray, SortedLongArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Smooth_nLargeSquares
Full constructor.- Smooth_Perfect - Class in de.tilman_neumann.jml.factor.base.congruence
A perfect smooth congruence.- Smooth_Perfect(BigInteger, SortedIntegerArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Smooth_Perfect
Full constructor.- Smooth_Simple - Class in de.tilman_neumann.jml.factor.base.congruence
A smooth congruence from a single AQ-pair.- Smooth_Simple(BigInteger, SortedIntegerArray) - Constructor for class de.tilman_neumann.jml.factor.base.congruence.Smooth_Simple
- solutionArrays - Variable in class de.tilman_neumann.jml.factor.siqs.poly.baseFilter.BaseFilter.Result
- SolutionArrays - Class in de.tilman_neumann.jml.factor.siqs.data
Passive data structure bundling primes/powers and their smallest x-solutions.- SolutionArrays(int, int) - Constructor for class de.tilman_neumann.jml.factor.siqs.data.SolutionArrays
Full constructor, allocates all arrays.- solve(Collection<? extends Partial>) - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
Solve a partial congruence equation system.- solve(Collection<? extends Smooth>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
Main method to solve a congruence equation system.- solve(List<Partial>, Map<Long, Integer>) - Method in class de.tilman_neumann.jml.factor.base.congruence.PartialSolver
Create the matrix from the pre-processed congruences and solve it.- solve(List<Smooth>, Map<Integer, Integer>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver
Create the matrix from the pre-processed congruences and solve it.- solve(List<Smooth>, Map<Integer, Integer>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver01_Gauss
- solve(List<Smooth>, Map<Integer, Integer>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixSolver02_BlockLanczos
- SomePowerFinder - Class in de.tilman_neumann.jml.factor.siqs.powers
Base class for PowerFinders that do indeed find some powers.- SomePowerFinder() - Constructor for class de.tilman_neumann.jml.factor.siqs.powers.SomePowerFinder
- SortedIntegerArray - Class in de.tilman_neumann.jml.factor.base
A reused buffer to store small factors temporarily during trial division.- SortedIntegerArray() - Constructor for class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- SortedList<T> - Class in de.tilman_neumann.util
Sorted list.- SortedList(SortedList<T>) - Constructor for class de.tilman_neumann.util.SortedList
Copy constructor.- SortedList(Comparator<T>, SortOrder) - Constructor for class de.tilman_neumann.util.SortedList
Complete constructor for a list sorted in ascending or descending order, where the comparison is done by an explicit constructor or the comparable capability of list elements.- SortedLongArray - Class in de.tilman_neumann.jml.factor.base
A reused buffer to store big factors of partials temporarily during trial division.- SortedLongArray() - Constructor for class de.tilman_neumann.jml.factor.base.SortedLongArray
- SortOrder - Enum in de.tilman_neumann.util
Sort orders.- spDivide(long) - Method in class de.tilman_neumann.jml.base.Uint128
Compute quotient and remainder of this / v.- sqrt(BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.roots.SqrtReal
Compute square root.- sqrt(BigDecimal, BigDecimal, Scale) - Static method in class de.tilman_neumann.jml.roots.SqrtReal
Compute square root with initial guess.- SqrtExact - Class in de.tilman_neumann.jml.roots
Fast recognition of exact integer squares, using the algorithm explained in class SqrtExactTest.- SqrtExact() - Constructor for class de.tilman_neumann.jml.roots.SqrtExact
- SqrtInt - Class in de.tilman_neumann.jml.roots
Fast sqrt() computation with integer solutions using Herons (or "Babylonian") method and the built-in Math.sqrt() as initial guess.- SqrtInt() - Constructor for class de.tilman_neumann.jml.roots.SqrtInt
- SqrtReal - Class in de.tilman_neumann.jml.roots
Compute square root of large numbers using Heron's method with a good initial guess.- SqrtReal() - Constructor for class de.tilman_neumann.jml.roots.SqrtReal
- square64(long) - Static method in class de.tilman_neumann.jml.base.Uint128
The square of an unsigned 64 bit integer.- SquarefreeSequence - Class in de.tilman_neumann.jml.sequence
Sequence of multiplier * {squarefree numbers 1,2,3,5,6,7,10,11,13,...}, BigInteger implementation.- SquarefreeSequence(long) - Constructor for class de.tilman_neumann.jml.sequence.SquarefreeSequence
- SquarefreeSequence(BigInteger) - Constructor for class de.tilman_neumann.jml.sequence.SquarefreeSequence
- SquarefreeSequence63 - Class in de.tilman_neumann.jml.sequence
Sequence of multiplier * {squarefree numbers 1,2,3,5,6,7,10,11,13,...}, long implementation.- SquarefreeSequence63(long) - Constructor for class de.tilman_neumann.jml.sequence.SquarefreeSequence63
- SquFoF31 - Class in de.tilman_neumann.jml.factor.squfof
Shanks' SQUFOF algorithm, 31-bit version.- SquFoF31() - Constructor for class de.tilman_neumann.jml.factor.squfof.SquFoF31
- SquFoF31Preload - Class in de.tilman_neumann.jml.factor.squfof
Shanks' SQUFOF algorithm, 31-bit version.- SquFoF31Preload() - Constructor for class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
- SquFoF63 - Class in de.tilman_neumann.jml.factor.squfof
Shanks' SQUFOF algorithm, 63-bit version.
Implemented according to http://en.wikipedia.org/wiki/Shanks'_square_forms_factorization.- SquFoF63() - Constructor for class de.tilman_neumann.jml.factor.squfof.SquFoF63
- SSOZJ - Class in de.tilman_neumann.jml.primes.exact
This Java source file is a multiple threaded implementation to perform an extremely fast Segmented Sieve of Zakiya (SSoZ) to find Twin Primes <= N.- SSOZJ() - Constructor for class de.tilman_neumann.jml.primes.exact.SSOZJ
- SSOZJ.Callback<T> - Interface in de.tilman_neumann.jml.primes.exact
- StackElement(long, long, double) - Constructor for class de.tilman_neumann.jml.primes.PrimeGapTest.StackElement
- standard(int) - Static method in class de.tilman_neumann.jml.combinatorics.HyperFactorial
A002109 or the standard "hyperfactorial" is the product {1^1*2^2*..n^n}.- start() - Method in class de.tilman_neumann.util.Timer
Restart timer.- Stirling - Class in de.tilman_neumann.jml.combinatorics
Computation of Stirling numbers.- Stirling() - Constructor for class de.tilman_neumann.jml.combinatorics.Stirling
- stirling1(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
(Signed) Stirling numbers of the first kind.- stirling1Diag(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
Calculates the diagonal of Stirling numbers of the first kind S1(n-k+1,1), S1(n-k+2,2), ..., S1(n-1,k-1), S1(n,k).- stirling2(int, int) - Static method in class de.tilman_neumann.jml.combinatorics.Stirling
Stirling numbers of the second kind S(n,k).- stringToList(String) - Static method in class de.tilman_neumann.jml.base.BigIntCollectionUtil
Factory method creating a list of big integers from the given comma-separated string.- stringToList(String) - Static method in class de.tilman_neumann.jml.base.IntCollectionUtil
Converts the given comma-separated string into a list of Integers.- StringUtil - Class in de.tilman_neumann.util
- subtract(BigRational) - Method in class de.tilman_neumann.jml.base.BigRational
Computes the subtraction of this and the argument.- subtract(Uint128) - Method in class de.tilman_neumann.jml.base.Uint128
Subtract two unsigned 128 bit integers.- subtract(Mpi) - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- subtract(Mpi) - Method in interface de.tilman_neumann.jml.partitions.Mpi
Returns the pair [lower, upper] of consecutive subvalues of this (according to the ordering relation) such that lower + other <= this and upper + other >= this.- subtract(BigDecimal, BigInteger) - Static method in class de.tilman_neumann.jml.base.BigDecimalMath
Computes the difference of a and b.- sum() - Method in class de.tilman_neumann.jml.partitions.IntegerPartition
- sum(Collection<BigInteger>) - Static method in class de.tilman_neumann.jml.base.BigIntCollectionUtil
- SumOf4Squares - Class in de.tilman_neumann.jml
Stuff concerning sums of 4 squares representations of natural numbers.- SumOf4Squares() - Constructor for class de.tilman_neumann.jml.SumOf4Squares
- sumOfDivisors(BigInteger) - Static method in class de.tilman_neumann.jml.Divisors
- sumOfDivisors(SortedMap<BigInteger, Integer>) - Static method in class de.tilman_neumann.jml.Divisors
Fast sum of divisors when the prime factorization is known.T
- t - Variable in class de.tilman_neumann.jml.factor.siqs.powers.PowerEntry
- tArray - Variable in class de.tilman_neumann.jml.factor.siqs.data.BaseArrays
-
the modular sqrt's t with t^2==kN (mod p) for primes p, or t^2==kN (mod power) for powers
- TDiv - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division for large arguments.
- TDiv() - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv
- TDiv_CF - Interface in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Interface for auxiliary factor algorithms to find smooth decompositions of Q's.
- TDiv_CF01 - Class in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Auxiliary factor algorithm to find smooth decompositions of Q's.
- TDiv_CF01() - Constructor for class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
- TDiv_CF02 - Class in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Auxiliary factor algorithm to find smooth decompositions of Q's.
- TDiv_CF02() - Constructor for class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02
- TDiv_CF03 - Class in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Auxiliary factor algorithm to find smooth decompositions of Q's.
- TDiv_CF03() - Constructor for class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF03
- TDiv_CF63 - Interface in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Interface for auxiliary factor algorithms to find smooth decompositions of Q's.
- TDiv_CF63_01 - Class in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Auxiliary factor algorithm to find smooth decompositions of Q's.
- TDiv_CF63_01() - Constructor for class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_01
- TDiv_CF63_02 - Class in de.tilman_neumann.jml.factor.cfrac.tdiv
-
Auxiliary factor algorithm to find smooth decompositions of Q's.
- TDiv_CF63_02() - Constructor for class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- TDiv_QS - Interface in de.tilman_neumann.jml.factor.siqs.tdiv
-
Interface for trial division engines to find the factorization of smooth Q(x) with given x.
- TDiv_QS_1Large - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can only have 1 large factor.
- TDiv_QS_1Large() - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- TDiv_QS_1Large_UBI - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can only have 1 large factor.
- TDiv_QS_1Large_UBI() - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- TDiv_QS_2Large_UBI - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can have up to 2 large factors.
- TDiv_QS_2Large_UBI(boolean) - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
-
Full constructor.
- TDiv_QS_2Large_UBI_BarrettD - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can have up to 2 large factors.
- TDiv_QS_2Large_UBI_BarrettD(boolean) - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
-
Full constructor.
- TDiv_QS_nLarge - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can have several large factors.
- TDiv_QS_nLarge(boolean) - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
-
Full constructor.
- TDiv_QS_nLarge_UBI - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine where partials can have several large factors.
- TDiv_QS_nLarge_UBI(boolean) - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
-
Full constructor.
- TDiv_QS_Small - Class in de.tilman_neumann.jml.factor.siqs.tdiv
-
A trial division engine used by SIQS_Small.
- TDiv_QS_Small() - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- TDiv31 - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division factor algorithm using the safe AutoExpandingPrimesArray class.
- TDiv31() - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv31
- TDiv31Barrett - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division using long-valued Barrett reduction, see https://en.wikipedia.org/wiki/Barrett_reduction.
- TDiv31Barrett() - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv31Barrett
- TDiv31Inverse - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division factor algorithm using double-valued Barrett reduction, thus replacing division by multiplications.
- TDiv31Inverse() - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv31Inverse
- TDiv63 - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division factor algorithm using the safe AutoExpandingPrimesArray class.
- TDiv63() - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv63
- TDiv63Inverse - Class in de.tilman_neumann.jml.factor.tdiv
-
Trial division factor algorithm replacing division by multiplications.
- TDiv63Inverse(int) - Constructor for class de.tilman_neumann.jml.factor.tdiv.TDiv63Inverse
-
Create a trial division algorithm that is capable of finding factors up to factorLimit.
- tdivLimit - Variable in class de.tilman_neumann.jml.factor.FactorAlgorithm
- TDivPrimeTest - Class in de.tilman_neumann.jml.primes.probable
-
A deterministic prime test for N < 32 bit using fast trial division.
- TDivReport - Class in de.tilman_neumann.jml.factor.siqs.tdiv
- TDivReport(long, long, long, long, long, long, long, Multiset<Integer>) - Constructor for class de.tilman_neumann.jml.factor.siqs.tdiv.TDivReport
- test() - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac
- test() - Method in class de.tilman_neumann.jml.factor.hart.HartLA63
- test(int) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31
- test(int) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF31Preload
- test(long) - Method in class de.tilman_neumann.jml.factor.cfrac.CFrac63
- test(long) - Method in class de.tilman_neumann.jml.factor.squfof.SquFoF63
- test(BigInteger) - Method in class de.tilman_neumann.jml.powers.PurePowerTest
-
Much faster power test, elaborated together with Graeme Willoughby.
- test(BigInteger, long) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_01
- test(BigInteger, long) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- test(BigInteger, long) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63
-
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
- test(BigInteger, BigInteger) - Method in interface de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF
-
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
- test(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF01
- test(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02
- test(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF03
- test_v01(BigInteger) - Method in class de.tilman_neumann.jml.powers.PurePowerTest
-
Test if N is a pure power. The algorithm is based on {@link "https://en.wikipedia.org/wiki/Rational_sieve#Limitations_of_the_algorithm"}, with several improvements pointed out by to Graeme Willoughby: 1.
- testBases(BigInteger, BigInteger[]) - Method in class de.tilman_neumann.jml.primes.probable.MillerRabinTest
-
Perform Miller-Rabin test of N to several bases.
- testForFactor(Set<AQPair>) - Method in interface de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest
-
Test if a square congruence A^2 == Q (mod kN) gives a factor of N.
- testForFactor(Set<AQPair>) - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest01
-
Test if a square congruence A^2 == Q (mod kN) gives a factor of N.
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large_UBI
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_1Large
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI_BarrettD
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_2Large_UBI
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge_UBI
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_nLarge
- testList(List<Integer>) - Method in class de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS_Small
- testList(List<Integer>) - Method in interface de.tilman_neumann.jml.factor.siqs.tdiv.TDiv_QS
-
Test if Q(x) is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base) for all x in the given list.
- TestMode - Enum in de.tilman_neumann.jml.factor
-
Factoring test mode.
- TestNumberNature - Enum in de.tilman_neumann.jml.factor
-
Definition of the "nature" of test numbers.
- TestsetGenerator - Class in de.tilman_neumann.jml.factor
-
Generation of random N that are not too easy to factor.
- TestsetGenerator() - Constructor for class de.tilman_neumann.jml.factor.TestsetGenerator
- TestsetGeneratorTest - Class in de.tilman_neumann.jml.factor
- TestsetGeneratorTest() - Constructor for class de.tilman_neumann.jml.factor.TestsetGeneratorTest
- testSingleBase(BigInteger, BigInteger) - Method in class de.tilman_neumann.jml.primes.probable.MillerRabinTest
-
Perform a single Miller-Rabin test of N to base x.
- timeDiffStr(long, long) - Static method in class de.tilman_neumann.util.TimeUtil
- Timer - Class in de.tilman_neumann.util
-
A simple time recorder.
- Timer() - Constructor for class de.tilman_neumann.util.Timer
-
Full constructor, starts timer.
- timeStr(long) - Static method in class de.tilman_neumann.util.TimeUtil
- TimeUtil - Class in de.tilman_neumann.util
-
Auxiliary class for formatting time strings.
- TimeUtil() - Constructor for class de.tilman_neumann.util.TimeUtil
- TinyEcm63 - Class in de.tilman_neumann.jml.factor.ecm
-
A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
- TinyEcm63() - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm63
- TinyEcm63.EcmResult - Class in de.tilman_neumann.jml.factor.ecm
- TinyEcm64 - Class in de.tilman_neumann.jml.factor.ecm
-
A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
- TinyEcm64() - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64
- TinyEcm64_MontInline - Class in de.tilman_neumann.jml.factor.ecm
-
A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
- TinyEcm64_MontInline() - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontInline
- TinyEcm64_MontInline.EcmResult - Class in de.tilman_neumann.jml.factor.ecm
- TinyEcm64_MontSqr - Class in de.tilman_neumann.jml.factor.ecm
-
A port of Ben Buhrow's tinyecm.c (https://www.mersenneforum.org/showpost.php?p=521028&postcount=84) an ECM implementation for unsigned 64 bit integers.
- TinyEcm64_MontSqr() - Constructor for class de.tilman_neumann.jml.factor.ecm.TinyEcm64_MontSqr
- TinyEcm64_MontSqr.EcmResult - Class in de.tilman_neumann.jml.factor.ecm
- TinyEcm64.EcmResult - Class in de.tilman_neumann.jml.factor.ecm
- toBigDecimal(Precision) - Method in class de.tilman_neumann.jml.base.BigRational
- toBigDecimal(Scale) - Method in class de.tilman_neumann.jml.base.BigRational
-
Converts this to a BigDecimal with decPrec digits precision.
- toBigInteger() - Method in class de.tilman_neumann.jml.base.Uint128
-
Convert this to BigInteger.
- toBigInteger() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- toBinaryString() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- toList() - Method in class de.tilman_neumann.jml.base.BigIntTriangle
- toList() - Method in class de.tilman_neumann.jml.base.NumberGrid
- toList() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- toList() - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- toString() - Method in class de.tilman_neumann.jml.base.BigIntTriangle
- toString() - Method in class de.tilman_neumann.jml.base.BigRational
- toString() - Method in class de.tilman_neumann.jml.base.NumberGrid
- toString() - Method in class de.tilman_neumann.jml.base.Uint128
- toString() - Method in class de.tilman_neumann.jml.base.UnsignedBigInt
- toString() - Method in class de.tilman_neumann.jml.factor.base.congruence.AQPair
- toString() - Method in class de.tilman_neumann.jml.factor.base.congruence.Smooth_Composite
- toString() - Method in class de.tilman_neumann.jml.factor.base.FactorResult
- toString() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
- toString() - Method in class de.tilman_neumann.jml.factor.base.matrixSolver.MatrixRow
- toString() - Method in class de.tilman_neumann.jml.factor.base.SortedIntegerArray
- toString() - Method in class de.tilman_neumann.jml.factor.base.SortedLongArray
- toString() - Method in class de.tilman_neumann.jml.gcd.EEA31.Result
- toString() - Method in class de.tilman_neumann.jml.gcd.EEA63.Result
- toString() - Method in class de.tilman_neumann.jml.partitions.IntegerPartition
-
Returns a sum-like representation of the additive multiset, with distinct keys separated by "+" and the multiplicity indicated by "*".
- toString() - Method in class de.tilman_neumann.jml.partitions.Mpi_IntegerArrayImpl
- toString() - Method in class de.tilman_neumann.jml.partitions.MpiPartition
-
Returns a sum-like representation of this partitions, with parts separated by "+" and the multiplicity indicated by "*".
- toString() - Method in class de.tilman_neumann.jml.precision.Precision
- toString() - Method in class de.tilman_neumann.jml.precision.Scale
- toString() - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
-
Returns a string representation of the unsorted multiset similar to collections, with distinct keys separated by commas and the multiplicity indicated by "^".
- toString() - Method in class de.tilman_neumann.util.Pair
- toString(Scale) - Method in class de.tilman_neumann.jml.base.BigRational
-
Converts this into a string with the given decimal digits precision.
- totalCount() - Method in class de.tilman_neumann.util.Multiset_HashMapImpl
- totalRuntime() - Method in class de.tilman_neumann.util.Timer
U
- Uint128 - Class in de.tilman_neumann.jml.base
-
An incomplete 128 bit unsigned int implementation.
- Uint128(long, long) - Constructor for class de.tilman_neumann.jml.base.Uint128
- UnsafeUtil - Class in de.tilman_neumann.jml.factor.base
-
Utility to provide a sun.misc.Unsafe instance and manages native memory.
- UnsignedBigInt - Class in de.tilman_neumann.jml.base
-
A very limited unsigned big integer implementation.
- UnsignedBigInt(int[]) - Constructor for class de.tilman_neumann.jml.base.UnsignedBigInt
-
Constructor using the given buffer.
- UnsignedBigInt(UnsignedBigInt) - Constructor for class de.tilman_neumann.jml.base.UnsignedBigInt
-
Copy constructor
- UnsignedBigInt(BigInteger) - Constructor for class de.tilman_neumann.jml.base.UnsignedBigInt
-
Shortcut constructor for
new UnsignedBigInt(); set(N);
- UnsignedBigIntTest - Class in de.tilman_neumann.jml.base
-
Test for UnsignedBigInt classes.
- UnsignedBigIntTest() - Constructor for class de.tilman_neumann.jml.base.UnsignedBigIntTest
- untestedFactors - Variable in class de.tilman_neumann.jml.factor.base.FactorResult
-
factors whose primeness has not been checked yet
- USE_FMA - Static variable in interface de.tilman_neumann.jml.factor.base.GlobalFactoringOptions
-
A switch to turn on using the "fused multiply-add" operation defined in IEEE 754-2008.
- USER_HOME - Static variable in class de.tilman_neumann.util.ConfigUtil
-
user home directory
V
- valueOf(int) - Static method in class de.tilman_neumann.jml.precision.Precision
- valueOf(int) - Static method in class de.tilman_neumann.jml.precision.Scale
- valueOf(String) - Static method in enum de.tilman_neumann.jml.factor.TestMode
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum de.tilman_neumann.jml.factor.TestNumberNature
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum de.tilman_neumann.util.SortOrder
-
Returns the enum constant of this type with the specified name.
- valueOf(BigInteger) - Static method in class de.tilman_neumann.jml.partitions.PrimePowers_DefaultImpl
-
Factory method to create Mpi from the prime powers of n.
- values() - Static method in enum de.tilman_neumann.jml.factor.TestMode
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum de.tilman_neumann.jml.factor.TestNumberNature
-
Returns an array containing the constants of this enum type, in the order they are declared.
- values() - Static method in enum de.tilman_neumann.util.SortOrder
-
Returns an array containing the constants of this enum type, in the order they are declared.
- verbose - Static variable in class de.tilman_neumann.util.ConfigUtil
W
- withStartResult(int, int, BigInteger) - Static method in class de.tilman_neumann.jml.combinatorics.Factorial
-
Computes the factorial for non-negative integer arguments applying the simple product rule, but allowing for a previously computed start value.
X
- x1Array - Variable in class de.tilman_neumann.jml.factor.siqs.data.SolutionArrays
- x2Array - Variable in class de.tilman_neumann.jml.factor.siqs.data.SolutionArrays
Z
- ZERO - Static variable in class de.tilman_neumann.jml.base.BigRational
All Classes All Packages