def sieve(n: int = 100):
	""" Prime Sieve:
	Creates a sieve that can be used to generate prime numbers up to and including 'n'.  If 'n' is prime, it will indicated as such by this sieve."""
	n += 1
	# Create a sequence of boolean values whose index equals the number being checked for primality.  If the element at index 'i' is true, 'i' is prime.
	l=[True for i in range(n)]
	l[0]=False; l[1]=False
	# Enumerate the elements in 'l'.  'p' is the index and equals the number being checked for primality.  'val' is the booleans value that indicates that 'p' is prime if it is set to 'True'.
	for p, val in enumerate(l):
		if val:
		# 'p' is prime.
			for i in range(p*2, n, p): l[i]=False
	return l