Factorization (#116)

Jonathan Frech, 9 April 2016

Playing around with prime numbers, I created this simple factorization program.
The interesting thing about prime factors is that they are unique. There can only be one way to multiply prime numbers to get 𝑛 where $n\in\mathbb{N}$ $n\in\mathbb{N}$ and $n\geq 2$ $n\geq 2$ (excluding the commutative property).For example, $2\cdot 3\cdot 7=42$ $2\cdot 3\cdot 7=42$ and that is the only way to multiply prime numbers to get to 42.

Source code: factorization.py