Search:

Here's the isPrime() function I'm using. It's brute force however it seems to be fairly fast.



public static boolean isPrime(int num)
{
if( num == 1)
{
return false;
}

That's what this line does.



if(number.contains("2")||number.contains("4")||number.contains("6")||number.contains("8")||number.contains("5")||number.contains("0"))//false if it contains an even...

I need help with my algorithm for finding circular primes. If you don't know what a circular prime is, it's when a number, say 179, and its rotations, 179, 917, and 791, are all prime. The algorithm...