@@ -0,0 +1,733 @@
+#!/usr/bin/python%0A%0A%22%22%22%0A    Have the user enter a number and %0A    dislay all Prime Factors (if there are any)%0A%22%22%22%0A%0A%22%22%22%0A    Check whether the given number is prime or not%0A%22%22%22%0Adef isPrime(x):%0A    # 1 and 2 are both prime numbers...%0A    if x ==1 or x == 2:%0A        return True%0A%0A    # If it's divisible by 2, it's not a prime number...%0A    if x %25 2 == 0:%0A        return False%0A%0A    # If x is evenly disivisble by 3, or any number up to sqrt(x) + 1%0A    # the number is not a prime number %0A    for i in range(3, int(x ** 0.5) + 1, 2):%0A        if x %25 i == 0:%0A            return False%0A%0A    return True%0A%0Adef main():%0A    for i in range(1, 100):%0A        print %22The number %25d is prime: %25r%22 %25 (i, isPrime(i))%0A%0Aif __name__ == %22__main__%22:%0A    main()%0A

Adding prime_factorization.py, first function complete isPrime(x) returns true or false for any supplied integer