# -*- coding: utf-8 -*-
import math
class PrimeService( object ):
""" http://en.wikipedia.org/wiki/Prime_number
"""
def __init__( self, count=5, start=1, end=None ):
if start < 1:
raise ValueError( "Must begin with a Natural Number" )
self.start = start
self.end = end
self.count = count
def slow_primes( self ):
""" returns a list of prime numbers """
primes = list()
for i in xrange( 2, 10 ):
if len( primes ) >= self.count:
break
if self._is_prime_trial_division( i ):
primes.append( i )
return primes
def _is_prime_trial_division( self , number ):
is_prime = True
for i in xrange( 2, int( math.sqrt( number) ) ): # divisor cannot be greater than the square root
print i
if number % i == 0:
is_prime = False
break
return is_prime
if __name__ == '__main__':
primes = PrimeService()
r = primes.slow_primes()
print r