For hash tables, int nextPrimeAfter(int) would be useful. On Tue, Aug 7, 2012 at 8:00 AM, matic <ma...@nimp.co.uk> wrote:
> would contain the following methods: > > public static boolean isPrime(int > n) > public static List<Integer> primeFactors(int n) > > and a few private > ones. >
