#!/usr/bin/env python
import eulerutils as eu
import sets
import math as ma
import OrderedSet
primeSet = eu.getPrimesBelowAsSet(10000)
newSet = set()
#OK, iterate through, and get all primes
def lowestOfList(listOfNumbers):
smallest = 9999999999999
for num in listOfNumbers:
if num < smallest:
smallest = num
return smallest
def trimNonPrimesFromList(listOfNumbers):
newList = []
for num in listOfNumbers:
if num in newSet:
newList.append(num)
return newList
import eulerutils as eu primes = eu.getPrimesBelowAsSet(88000) print "got primes, size %d" % len(primes) def calc(n, a, b): return (n*n) + (a*n) + b most = 0 num = -1 aval = -1 bval = -1 for a in range(-1000, 1001): print a for b in range(-1000, 1001): count = 0 for n in range(0, 200): if( (n % 2) == 0 and (a % 2) == 0 and (b % 2) == 0): continue val = calc(n,a,b) if(val in primes): count += 1 else: if(count > most): most = count num = n aval = a bval = b print "Found new Highest Value: most=%d num=%d aval=%d bval=%d" % (most, num, aval, bval)
#!/usr/bin/env python
import eulerutils as eu
primes = eu.getPrimesBelowAsSet(10000)
for prime in primes:
if(prime < 1000):
primes.remove(prime)
dictOfPrimeRotations={}
for prime in primes:
import eulerutils as eu
primes = eu.getPrimesBelowAsSet(88000)
print "got primes, size %d" % len(primes)
def calc(n, a, b):
return (n * n) + (a * n) + b
most = 0
num = -1
aval = -1
bval = -1
for a in range(-1000, 1001):
print a
for b in range(-1000, 1001):
count = 0
for n in range(0, 200):
if ((n % 2) == 0 and (a % 2) == 0 and (b % 2) == 0):
continue
val = calc(n, a, b)
if (val in primes):
count += 1
else:
if (count > most):
most = count
num = n
aval = a