Problem 3 - Project Euler

The problem requires the largest prime factor for a given number.

Our solution tests for prime factors and using iteration we can return the largest possible prime for the given number.