private static List <long> ReturnLargestPrimeFactors(long n)
{
var summand = new List <long>();
for (long i = 2; i <= n; i++)
{
summand.Add(PrimeUtility.LargestPrimeFactor(i));
}
return(summand);
}
public static long Solution()
{
return(PrimeUtility.LargestPrimeFactor(600851475143));
}
public void LargestPrimeFactor_Integers_ReturnsResult(long n, long value)
{
var result = PrimeUtility.LargestPrimeFactor(n);
Assert.AreEqual(value, result);
}