Example #1
0
def main():
	n = 50
	siv = set(numbertheory.primeSieve(n))
	a = set(range(n))
	a = a.difference(siv)
	print len(a)

	for x in a:
		ug = unitGroup(x)
		print x, zip(ug,map(lambda i: pow(i,2,x),ug))
Example #2
0
# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

# What is the 10001st prime number?

from numbertheory import primeSieve


print primeSieve(1500000)[10000]