static void Main(string[] args)
{
//SmallPrimeGenerator primeTestGen = new SmallPrimeGenerator(50);
//foreach (int prime in primeTestGen)
//{
// Console.WriteLine(prime);
//}
FactorEnumerator factorTestGen = new FactorEnumerator(600851475143);
foreach (long factor in factorTestGen)
{
Console.WriteLine(factor);
}
Console.WriteLine("DONE");
Console.ReadKey();
}
static void Main(string[] args)
{
//SmallPrimeGenerator primeTestGen = new SmallPrimeGenerator(50);
//foreach (int prime in primeTestGen)
//{
// Console.WriteLine(prime);
//}
FactorEnumerator factorTestGen = new FactorEnumerator(600851475143);
foreach (long factor in factorTestGen)
{
Console.WriteLine(factor);
}
Console.WriteLine("DONE");
Console.ReadKey();
}
static void Main(string[] args)
{
long factorCount = 0;
long triangleNumberSequenceIndex = 1;
long runningSum = 0;
while (factorCount < 501)
{
runningSum = runningSum + triangleNumberSequenceIndex;
Console.Write(String.Format("Testing {0}...Total {1}...", triangleNumberSequenceIndex, runningSum));
FactorEnumerator factoringTool = new FactorEnumerator(runningSum);
factorCount = factoringTool.Count();
Console.WriteLine(String.Format("{0} divisors.", factorCount));
triangleNumberSequenceIndex = triangleNumberSequenceIndex + 1;
}
Console.WriteLine(String.Format("The Trianglenumber is {0} its value is {1}. It has {2} factors.", triangleNumberSequenceIndex, runningSum, factorCount));
Console.ReadKey();
}
static void Main(string[] args)
{
long factorCount = 0;
long triangleNumberSequenceIndex = 1;
long runningSum = 0;
while (factorCount < 501)
{
runningSum = runningSum + triangleNumberSequenceIndex;
Console.Write(String.Format("Testing {0}...Total {1}...", triangleNumberSequenceIndex, runningSum));
FactorEnumerator factoringTool = new FactorEnumerator(runningSum);
factorCount = factoringTool.Count();
Console.WriteLine(String.Format("{0} divisors.", factorCount));
triangleNumberSequenceIndex = triangleNumberSequenceIndex + 1;
}
Console.WriteLine(String.Format("The Trianglenumber is {0} its value is {1}. It has {2} factors.", triangleNumberSequenceIndex, runningSum, factorCount));
Console.ReadKey();
}
static void Main(string[] args)
{
FactorEnumerator factors = new FactorEnumerator(testValue);
List <long> foundFactors = factors.ToList();
long highestCurrentPrime = 0;
foreach (long factor in foundFactors)
{
if (NumberSenseTools.IsAPrime(factor))
{
if (factor > highestCurrentPrime)
{
highestCurrentPrime = factor;
}
}
}
Console.WriteLine(String.Format("Anwser is {0}.", highestCurrentPrime));
Console.ReadKey();
}
