In [37]:

    

def list_primes(n):
    
    """Takes an integer and returns all prime numbers less than it

Parameters
----------
Input:
n:Integer
A number greater than 0


Output:
lst: list
A list of integers that are listed up to the Integer/nearest prime number if the integer itself is not prime

"""
    lst = []
    for i in range(2,n+1):
        for num in range (2,i):
            if i % num == 0:
                break
        else:
                lst.append(i)            
    return lst


    

In [ ]:

    




    

In [38]:

    

list_primes(54)


    

    
Out[38]:





[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]

In [39]:

    

%%writefile test_list_primes.py
from nose.tools import assert_equal


class Test_list_primes(object):

    def test_list_primes(self):
        assert_equal(list_primes(1), [])
        assert_equal(list_primes(2), [2])
        assert_equal(list_primes(7), [2, 3, 5, 7])
        assert_equal(list_primes(9), list_primes(7))
        print('Success: test_list_primes')


def main():
    test = Test_list_primes()
    test.test_list_primes()


if __name__ == '__main__':
    main()


    

    




Overwriting test_list_primes.py

In [ ]:

    




    

In [ ]: