-
Notifications
You must be signed in to change notification settings - Fork 0
/
EulerP46.py
63 lines (49 loc) · 1.12 KB
/
EulerP46.py
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
51
52
53
54
55
56
57
58
59
60
61
62
63
import time
def isPrime(n):
if n == 1:
return False
if n == 2 or n == 3:
return True
elif n % 2 != 0 and n % 3 != 0:
for curr in range(3, int(n**0.5) + 1, 2):
if n % curr == 0:
return False
return True
else:
return False
def isConjectureTrue(N):
"""
n = N
s = 1
while True:
n -= 2
if n <= 0:
return False
if isPrime(n):
while n + 2 * (s**2) <= N:
if n + 2 * (s**2) == N:
return True
else:
s += 1
"""
SqBase = 1
while True:
double_square = 2*SqBase**2
if N-double_square < 0:
return False
if isPrime(N-double_square):
return True
SqBase += 1
return False
def solve():
N = 33
while True:
if not isConjectureTrue(N):
return N
while True:
N += 2
if not isPrime(N):
break
start = time.time()
ans = solve()
print "Ans:", ans, "found in", time.time() - start, "seconds"