How can I find the least prime number greater than a given number? For example, given 4, I need 5; given 7, I need 11.
I would like to know some ideas on best algor
private static int nextPrime(int num) { num++; for (int i = 2; i