public class Primes
extends java.lang.Object
int:
| Modifier | Constructor and Description |
|---|---|
private |
Primes()
Hide utility class.
|
| Modifier and Type | Method and Description |
|---|---|
static boolean |
isPrime(int n)
Primality test: tells if the argument is a (provable) prime or not.
|
static int |
nextPrime(int n)
Return the smallest prime greater than or equal to n.
|
static java.util.List<java.lang.Integer> |
primeFactors(int n)
Prime factors decomposition
|
public static boolean isPrime(int n)
It uses the Miller-Rabin probabilistic test in such a way that a result is guaranteed: it uses the firsts prime numbers as successive base (see Handbook of applied cryptography by Menezes, table 4.1).
n - number to test.public static int nextPrime(int n)
n - a positive number.MathIllegalArgumentException - if n < 0.public static java.util.List<java.lang.Integer> primeFactors(int n)
n - number to factorize: must be ≥ 2MathIllegalArgumentException - if n < 2.Copyright (c) 2003-2015 Apache Software Foundation