Pyprime

Return all primes over an interval
import sys m=int(sys.argv[1]) n=int(sys.argv[2]) primes = [i for i in range(m,n) if all(i%j !=0 for j in range(2,int(i**0.5) + 1))] print(primes)
 * 1) !/usr/bin/python3



Use list comprehension to make a #Python one-liner that prints the prime numbers from 1 to 5000
python -c "print([i for i in range(1,5000) if all(i%j !=0 for j in range(2,int(i**0.5) + 1))])"