Compute the prime factors of a given natural number.
A prime number is only evenly divisible by itself and 1.
Note that 1 is not a prime number.
What are the prime factors of 60?
Our successful divisors in that computation represent the list of prime factors of 60: 2, 2, 3, and 5.
You can check this yourself:
Sometimes it is necessary to raise an exception. When you do this, you should include a meaningful error message to indicate what the source of the error is. This makes your code more readable and helps significantly with debugging. Not every exercise will require you to raise an exception, but for those that do, the tests will only pass if you include a message.
To raise a message with an exception, just write it as an argument to the exception type. For example, instead of
raise Exception, you should write:
raise Exception("Meaningful message indicating the source of the error")
To run the tests, run the appropriate command below (why they are different):
Alternatively, you can tell Python to run the pytest module (allowing the same command to be used regardless of Python version):
python -m pytest prime_factors_test.py
-v: enable verbose output
-x: stop running tests on first failure
--ff: run failures from previous test before running other test cases
For other options, see
python -m pytest -h
Note that, when trying to submit an exercise, make sure the solution is in the
You can find your Exercism workspace by running
exercism debug and looking for the line that starts with
For more detailed information about running tests, code style and linting, please see the help page.
The Prime Factors Kata by Uncle Bob http://butunclebob.com/ArticleS.UncleBob.ThePrimeFactorsKata
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
import unittest from prime_factors import prime_factors # Tests adapted from `problem-specifications//canonical-data.json` @ v1.1.0 class PrimeFactorsTest(unittest.TestCase): def test_no_factors(self): self.assertEqual(prime_factors(1), ) def test_prime_number(self): self.assertEqual(prime_factors(2), ) def test_square_of_a_prime(self): self.assertEqual(prime_factors(9), [3, 3]) def test_cube_of_a_prime(self): self.assertEqual(prime_factors(8), [2, 2, 2]) def test_product_of_primes_and_non_primes(self): self.assertEqual(prime_factors(12), [2, 2, 3]) def test_product_of_primes(self): self.assertEqual(prime_factors(901255), [5, 17, 23, 461]) def test_factors_include_a_large_prime(self): self.assertEqual(prime_factors(93819012551), [11, 9539, 894119]) if __name__ == '__main__': unittest.main()
def prime_factors(num): factors =  i = 2 while i <= num: if num % i == 0: factors.append(i) num /= i else: i += 1 return factors
A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.
Here are some questions to help you reflect on this solution and learn the most from it.