def start():
buf = int(random.random() * 10000)
t = pyprimes.next_prime(buf)
buf = int(random.random() * 10000)
p = pyprimes.next_prime(buf)
g = primitive_root(p)
buf = divmod(g**t, p)
T = buf[1]
return t, p, g, T
def test_primes_end_is_exclusive(self):
# End argument to primes() is exclusive.
n = 211
assert pyprimes.is_prime(n)
it = pyprimes.primes(end=n)
values = list(it)
self.assertEqual(values[-1], 199)
assert pyprimes.next_prime(199) == n
def test_primes_end_is_exclusive(self):
# End argument to primes() is exclusive.
n = 211
assert pyprimes.is_prime(n)
it = pyprimes.primes(end=n)
values = list(it)
self.assertEqual(values[-1], 199)
assert pyprimes.next_prime(199) == n
def run():
n_n=10**14
p=[]
for i in xrange(100001):
n_n=pyprimes.next_prime(n_n)
p.append(n_n)
with open('primes304.txt','wb') as f:
pickle.dump(p, f)
print n_n
def run(n):
#n=10**6
l = primes3(10**6)
l+= [next_prime(l[-1])]
print l[-3:]
s=0
print len(l)
for i in xrange(len(l)-2,len(l)-1):
p1,p2 = l[i],l[i+1]
#print p1,p2
mul =1
m=p2
while not is_right(p1, m):
m+=p2
print p1,p2,m,m/p2
#print p1
s+=m
print s
def _resize(self):
old_capacity = self._capacity
self._capacity = next_prime(old_capacity * 2)
if self._method == SEPARATE_CHAINING:
rehashed = []
for i, el in enumerate(self._table):
if len(el) > 0:
rehashed.extend(el)
self._table[i] = []
for j in range(self._capacity - old_capacity):
rehashed.append([])
else:
rehashed = []
for i, el in enumerate(self._table):
if el is not None:
rehashed.append(el)
self._table[i] = None
for j in range(self._capacity - old_capacity):
rehashed.append(None)
# now that everything is resized, rehash again
for el in rehashed:
self.insert(el)
def test_next_prime(self):
self.assertEqual(pyprimes.next_prime(122949823), 122949829)
self.assertEqual(pyprimes.next_prime(961748927), 961748941)
def start(p, g):
buf = int(random.random() * 10000)
a = pyprimes.next_prime(buf)
buf = divmod(g**a, p)
A = buf[1]
return a, A
def test_next_prime(self):
self.assertEqual(pyprimes.next_prime(122949823), 122949829)
self.assertEqual(pyprimes.next_prime(961748927), 961748941)
from pyprimes import next_prime
# Problem 10
current_p = 2
sum = 2
while (True):
next_p = next_prime(current_p)
if next_p >= 2000000:
print('The solution is %d' % sum)
break
sum += next_p
current_p = next_p
def start(p, g):
buf = int(random.random()*10000)
b = pyprimes.next_prime(buf)
buf = divmod(g**b, p)
B = buf[1]
return b, B
