http://snippets.bentasker.i2p/posts/python/find-all-prime-numbers-in-range.html
. # Number is prime return True def calculatePrimesForRange ( s , e ): ''' Iterate over each integer between start and end return list ''' primes = [] while s < e : if checkNumPrime ( s ): primes . append ( s ) s = s + 1 return primes Usage Example print calculatePrimesForRange ( 1 , 100 ) [ 1 , 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 25 , 29 , 31 , 35 , 37 , 41 , 43 , 47 , 49 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97 ] python Previous post Next post Contents © 2026 Ben Tasker |...