Challenge: Prime Factor

Problem statement

Prime factors are the combinations of the smallest prime numbers that, when multiplied together, will produce the original number. Consider the following examples:

• Prime factors of $4$ are: $2 x 2$

• Prime factors of $7$ are: $7$

• Prime factors of $30$ are: $5 x 3 x 2$

• Prime factors of $40$ are: $5 x 2 x 2 x 2$

• Prime factors of $50$ are: $5 x 5 x 2$

Implement your solution in three projects created for you:

1. A class library in the PrimeFactorsLib project with a static class and static method named PrimeFactors that, when passed an int variable as a parameter returns a string showing its prime factors.

2. A unit test in the unit test project named PrimeFactorsTests with a few suitable unit tests.

3. A console application to use in the PrimeFactorsApp project.

To keep it simple, assume that the largest number entered will be $1000$.

Expected output

The result of running your console app should look something like this: