primes.py

# one-liner 
primes = lambda n: [i for i in range(2, n) if not ["" for j in range(2, i) if i%j==0]]
print(primes(55))


# the previous one-liner code after unpacking .
def primes(n):
	all_primes = []
	for i in range(2, n):
		factors = []
		for j in range(2, i):
			if i%j==0:
				factors.append(j)
		if factors==[]:
			all_primes.append(i)
	return all_primes
#print(primes(55))


# Time saver & optimized solution for finding all primes in an interval .
def getFactors(n):
	factors = []
	for i in range(1, int(n**0.5+1)):
		if n%i==0:
			factors = factors + [i, n//i]
	return factors
def isPrime(n):
	return len(getFactors(n))==2 if n!=1 else False
for i in range(1, 55):
	if isPrime(i):
		#print(i)
		pass