internal static string Largest_prime_factor()
{
var primes = Divisors.GetPrimeListOfDivisors(n);
foreach (var prime in primes)
{
MathsProblemsForm.Log(prime.ToString());
}
var maxPrime = primes[primes.Count - 1];
return(maxPrime.ToString());
}
private static bool HasUniquePrimes(long value, int count)
{
var primeList = Divisors.GetPrimeListOfDivisors(value, true);
if (primeList.Count >= count)
{
var uniquePrimeList = new List <Int64>();
foreach (var i in primeList)
{
if (uniquePrimeList.IndexOf(i) < 0)
{
uniquePrimeList.Add(i);
if (uniquePrimeList.Count == count)
{
return(true);
}
}
}
return(uniquePrimeList.Count == count);
}
return(false);
}
