com.github.joineral32.common

Class PrimalityUtil

java.lang.Object

com.github.joineral32.common.PrimalityUtil

public final class PrimalityUtil
extends Object

Provides a set of static utility methods useful for finding and testing prime numbers

Since:

1.0

Author:

Alec

Method Summary

Modifier and Type	Method and Description
static boolean	isPrime(long number) Determines whether a given value is prime.
static boolean	isPrime(Long number) Determines whether a given value is prime.
static long	nthPrime(int n) Returns nth prime number.
static long	nthPrime(Integer n) Returns nth prime number.

Methods inherited from class java.lang.Object

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

Method Detail

isPrime

public static boolean isPrime(@Nonnull
                              Long number)

Determines whether a given value is prime. Runs with θ(√n) time complexity for a given input value n. Uses memoization internally to prevent redundant computations.

Parameters:

number - Number to determine primality of. Must be non-null.

Returns:

True if the given number is prime, false otherwise.

isPrime

public static boolean isPrime(long number)

Determines whether a given value is prime. Runs with θ(√n) time complexity for a given input value n. Uses memoization internally to prevent redundant computations.

Parameters:

number - Number to determine primality of.

Returns:

True if the given number is prime, false otherwise.

nthPrime

public static long nthPrime(@Nonnegative @Nonnull
                            Integer n)

Returns nth prime number. Uses memoization internally to prevent redundant computations.

Parameters:

n - which prime number to compute. Example: if n is 6, computes the 6th prime number. Must be non-null

Returns:

the value of the nth prime number for the given n value.

nthPrime

public static long nthPrime(@Nonnegative
                            int n)

Returns nth prime number. Uses memoization internally to prevent redundant computations.

Parameters:

n - which prime number to compute. Example: if n is 6, computes the 6th prime number.

Returns:

the value of the nth prime number for the given n value.