-
Notifications
You must be signed in to change notification settings - Fork 0
/
lequal2.sage.py
38 lines (31 loc) · 1.08 KB
/
lequal2.sage.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
# This file was *autogenerated* from the file lequal2.sage
from sage.all_cmdline import * # import sage library
_sage_const_1 = Integer(1); _sage_const_0 = Integer(0); _sage_const_3 = Integer(3)
import hashlib
import struct
from datetime import datetime
import math
import json
from basesage import *
def lequal2():
hashtable = {}
p = [_sage_const_1 , _sage_const_1 , _sage_const_1 ]
while True:
(p, carry) = increaseP(p)
print(p)
if carry:
print('failed')
print(hashtable)
break
evalp = unevaluate2(p)
for i in range(_sage_const_0 , len(evalp)):
if str(evalp[i]) in hashtable:
hashtable[str(evalp[i])].append(p[:])
# print('adding a new entry to c: '+str(evalp[i])+' with value: '+str(p)+' new entry: '+str(hashtable[str(evalp[i])]))
if len(hashtable[str(evalp[i])]) >= _sage_const_3 :
print(str(hashtable[str(evalp[i])])+' all have the same c: '+str(evalp[i]))
# return ''
else:
hashtable[str(evalp[i])] = [p[:]]
# print('create a new entry to c: '+str(evalp[i])+' with value: '+str(p)+' new entry: '+str(hashtable[str(evalp[i])]))
lequal2()