ProjectEuler/P27_Quadratic_Primes.py at master · abdullah768/ProjectEuler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
prime=[0]*100001
for i in range(2,100001):
    if(prime[i]==0):
        for j in range (i+i,100001,i):
            prime[j]=1;
prm=[]
for i in range(2,1001):
    if(prime[i]==0):
        prm.append(i);
m=0
res=0
for i in range (1,1001):
    a1=i
    for j in prm:
        x=1
        k=j;
        while(prime[k]==0):
            k=x*x+x*i+j;
            x=x+1;
        if(x>m):
            m=x
            res=i*j
        x=1
        k=j;
        while(prime[k]==0):
            k=abs(x*x+x*i-j);
            x=x+1;
        if(x>m):
            m=x
            res=i*j*-1
    a1=-1*i
    for j in prm:
        x=1
        k=j;
        while(prime[k]==0):
            k=abs(x*x+x*a1+j);
            x=x+1;
        if(x>m):
            m=x
            res=i*j*-1
        x=1
        k=j;
        while(prime[k]==0):
            k=abs(x*x+x*a1-j);
            x=x+1;
        if(x>m):
            m=x
            res=i*j
print(m,res)