欧拉曾发表过一个著名的二次公式:
n² + n + 41
这个公式对于0到39的连续数字能够产生40个质数。但是当 n = 40时,402 + 40 + 41 = 40(40 + 1) + 41能够被41整除。当n = 41时, 41² + 41 + 41显然也能被41整除。
利用计算机,人们发现了一个惊人的公式:n² 79n + 1601。这个公式对于n = 0 到 79能够产生80个质数。这个公式的系数,79 和1601的乘积是126479。
考虑如下形式的二次公式:
n² + an + b, 其中|a| <1000, |b| <1000
其中|n| 表示 n 的绝对值。
例如, |11| = 11, |4| = 4
对于能够为从0开始的连续的n产生最多数量的质数的二次公式,找出该公式的系数乘积。
原题:
Euler discovered the remarkable quadratic formula:
n² + n + 41
It turns out that the formula will produce 40 primes for the consecutive values n = 0 to 39. However, when n = 40, 402 + 40 + 41 = 40(40 + 1) + 41 is divisible by 41, and certainly when n = 41, 41² + 41 + 41 is clearly divisible by 41.
The incredible formula n² − 79n + 1601 was discovered, which produces 80 primes for the consecutive values n = 0 to 79. The product of the coefficients, −79 and 1601, is −126479.
Considering quadratics of the form:
n² + an + b, where | a| < 1000 and | b| < 1000
where | n| is the modulus/absolute value of n
e.g. |11| = 11 and |−4| = 4
Find the product of the coefficients, a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n = 0.
解题思路:
将0代入通式中,原式=b,可知b一定为质数,将1代入通式中,可推出a为奇数,尽可能多的分析限定循环条件,然后遍历给出结果
public class Launcher {
public static void main(String[] args) {
Vector<Integer> loop=new Vector<Integer>();
int n =0;
int size=0;
int max=0;
int sum=0;
for(int i=-999;i<1000;i+=2){
for(int j=3;j<1000;j+=2){
if(is_prime(j)){
for(int k=0;;k++){
n=(int) (Math.pow(k,2)+i*k+j);
if(is_prime(Math.abs(n)))
{
loop.add(n);
}else{
size=loop.size();
break;
}
}
}
if(max<size){
max=size;
sum=i*j;
}
loop.removeAllElements();
}
}
System.out.println(sum);
}
public static boolean is_prime(int i)
{
for(int j=2;j<=Math.sqrt(i);j++){
if(i%j==0)
{
return false;
}
}
return true;
}
}