Ejemplo n.º 1
0
def get_prime_v2(primePosition):
	"""
	Sieve the numbers.

	>>> get_prime_v2(6)
	13
	"""
	maxCandidate = 64
	minPrime = 3

	primes = [2]
	nonPrimes = set()

	while primePosition > len(primes):
		maxCandidate *= 2

		for factor in range(2, 1 + ceil(sqrt(maxCandidate))):
			if Prime.is_prime(factor):
				nonPrime = factor * 2
			else:
				nonPrime = factor

			while nonPrime <= maxCandidate:
				nonPrimes.add(nonPrime)
				nonPrime += factor

		primes.extend([n for n in range(minPrime, maxCandidate+1, 2) if n not in nonPrimes])
		minPrime = maxCandidate + 1
	
	return primes[primePosition - 1]
Ejemplo n.º 2
0
def get_prime_v1(primePosition):
	"""
	>>> get_prime_v1(6)
	13
	"""
	n = 3
	primeNumbersSeen = 1 # 2 is prime
	while True:
		if Prime.is_prime(n):
			primeNumbersSeen += 1
			if primeNumbersSeen == primePosition:
				return n
		n += 2