org.matheclipse.core.expression

Class Primality

java.lang.Object

org.matheclipse.core.expression.Primality

public class Primality
extends java.lang.Object

Provides primality probabilistic methods. Copied from Apache Harmony projects java.math package.

Method Summary

Modifier and Type	Method and Description
static java.math.BigInteger	countExponent(java.math.BigInteger val, java.math.BigInteger base) Get the highest exponent of base (greater than 1) that divides val.
static java.math.BigInteger	countPrimes1021(java.math.BigInteger val, java.util.Map<java.lang.Integer,java.lang.Integer> map) Factor the given value into primes less equal than 1021.
static java.math.BigInteger	countPrimes32749(java.math.BigInteger val, java.util.Map<java.lang.Integer,java.lang.Integer> map) Factor the given value into primes less than Short.MAX_VALUE.
static void	pollardRhoFactors(java.math.BigInteger val, java.util.Map<java.math.BigInteger,java.lang.Integer> map)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

countPrimes1021

public static java.math.BigInteger countPrimes1021(java.math.BigInteger val,
                                                   java.util.Map<java.lang.Integer,java.lang.Integer> map)

Factor the given value into primes less equal than 1021.

Parameters:

val - a BigInteger value which should be factored by all primes less equal than 1021

map - a map which counts the prime integer factors less equal than 1021

Returns:

the rest factor or zero, if the number could be factored completely into primes less equal then 1021

countPrimes32749

public static java.math.BigInteger countPrimes32749(java.math.BigInteger val,
                                                    java.util.Map<java.lang.Integer,java.lang.Integer> map)

Factor the given value into primes less than Short.MAX_VALUE.

Parameters:

val - a BigInteger value which should be factored by all primes less equal than 1021

map - a map which counts the prime integer factors less equal than 32749

Returns:

the rest factor or zero, if the number could be factored completely into primes less equal then 1021

countExponent

public static java.math.BigInteger countExponent(java.math.BigInteger val,
                                                 java.math.BigInteger base)

Get the highest exponent of base (greater than 1) that divides val.

Parameters:

val - a BigInteger value

base - a base greater than 1

Returns:

the exponent, which is the highest exponent of base that divides val.

pollardRhoFactors

public static void pollardRhoFactors(java.math.BigInteger val,
                                     java.util.Map<java.math.BigInteger,java.lang.Integer> map)