Showing content from http://svn.python.org/projects/python/branches/r23b1-branch/Demo/scripts/primes.py below:
#! /usr/bin/env python # Print prime numbers in a given range def main(): import sys min, max = 2, 0x7fffffff if sys.argv[1:]: min = int(eval(sys.argv[1])) if sys.argv[2:]: max = int(eval(sys.argv[2])) primes(min, max) def primes(min, max): if 2 >= min: print 2 primes = [2] i = 3 while i <= max: for p in primes: if i%p == 0 or p*p > i: break if i%p <> 0: primes.append(i) if i >= min: print i i = i+2 main()
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4