Quadratic Primes
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
class Main {
public static void main(String[] args) {
int a = -1000;
int b = -1000;
int a1 = 0;
int b1 = 0;
int z = 0;
int n = 0;
int y = 2;
int length = 0;
while(a <= 1000) {
while(b <= 1000) {
y = 2;
while(getPrime(y)) {
int n1 = (int) Math.pow(n,2);
y = n1 + n * a + b;
n += 1;
length += 1;
}
if(length > z) {
a1 = a;
b1 = b;
z = length;
System.out.println(a1 + ", " + b1 + ", " + z);
}
b += 1;
n = 0;
length = 0;
}
b = 0;
a += 1;
}
System.out.println(a1 * b1);
}
public static boolean getPrime(int x) {
int sqrt = (int) Math.sqrt(x);
if(x <= 1) {
return false;
}
else if(x < 4) {
return true;
}
else{
if(x % 2 == 0) {
return false;
}
for(int i = 3; i <= sqrt; i += 2) {
if(x % i == 0) {
return false;
}
}
return true;
}
}
}
Java
INFO