コード例 #1
0
ファイル: conjproof.py プロジェクト: terdel-ninja/REMYS2016
from Data import Data
from LoadingBar import LoadingBar
data = Data()
twins = data.twinspec()
print len(data.ordells())
def is_prime(n):
  if n == 2 or n == 3: return True
  if n < 2 or n%2 == 0: return False
  if n < 9: return True
  if n%3 == 0: return False
  r = int(n**0.5)
  f = 5
  while f <= r:
    if n%f == 0: return False
    if n%(f+2) == 0: return False
    f +=6
  return True    
  
def gendata(n):
    w = open("primes1mod3.txt", "w+")
    i = 1
    while i <= n:
        if is_prime(i): w.write(str(i) + "\n")
        i = i + 3
    print "done"

#data = Data()
#primes = data.primes1mod3()

def sloanexy(p):
    found = 0