Prime Factorization

Template: Click this link, and share with mrcodeswildride: new project

Technique

Use a technique called recursion, which is breaking down a problem into smaller problems until it can't be broken down anymore. There are two ways to apply recursion.
The first way is to use a loop, typically a while loop. For this project, you would find the number's lowest prime factor in a loop, and continue looping until the next number can't be factored.
The second way is to have a function call itself. For this project, you would have a function that finds a number's lowest prime factor, and have that function call itself until the next number can't be factored.

Hints

For determining if a number is a factor, use the remainder operator.
Last section Next section