public static int PropertyTest(int testSize, int resultValue = 0) //
{
int seriesLength = testSize;
var fibSeries = new FibonacciSeries {
};
fibSeries.fibonacciSeries = fibSeries.CalculateSeries(1, seriesLength);
int sumOfFibInts = Access.SumOfIntList(fibSeries.fibonacciSeries);
List <int> equalFibs = Access.RemoveModulusFromList(fibSeries.fibonacciSeries, 2, 0);
int sumOfEqualFibInts = Access.SumOfIntList(equalFibs);
Console.WriteLine("\nThe Fibonacci Series go up to {0}\n", seriesLength);
Access.PrintList(fibSeries.fibonacciSeries, 5);
Console.Write("The sum of Fibonacci series up to is {0}\n", seriesLength);
Access.PrintList(equalFibs, 5);
Console.Write("The sum of the Fibonacci Series including only equal results is {0}\n", sumOfEqualFibInts);
Console.WriteLine("\n Lets have a look:" +
"\n All fibs minus the sum of equal fibs: {0} - {1} = {2}" +
"\n All fibs divided by two: {0} / 2 = {3}\n\n", sumOfFibInts, sumOfEqualFibInts, sumOfFibInts - sumOfEqualFibInts, sumOfFibInts / 2);
Console.ReadLine();
return(seriesLength);
}
public static List <FibonacciGainQualities> GainPropertyTest(int testSize, int numberOfRounds = 5, int productFactor = 10, bool trueADDorFalsePRODUCT = false, bool showFlavorText = true)
{
int lastIteration = 0;
List <FibonacciGainQualities> interestingNumbers = new List <FibonacciGainQualities>();
int seriesMaxNumeric = testSize;
for (int i = 0; i < numberOfRounds; i++)
{
var fibSeries = new FibonacciSeries {
}; // create Fibonacci Series Object
fibSeries.fibonacciSeries = fibSeries.CalculateSeries(1, seriesMaxNumeric); // generate appropriately capped Fib series
int sumOfFibInts = Access.SumOfIntList(fibSeries.fibonacciSeries); // generate/get the sum of the found series
List <int> equalFibs = Access.RemoveModulusFromList(fibSeries.fibonacciSeries, 2, 0); // generate the list containing only equal results
int sumOfEqualFibInts = Access.SumOfIntList(equalFibs); // get/generate the sum of the equal-results-list
if (Access.ApproximatelyEqual(sumOfFibInts / 2, sumOfEqualFibInts)) // if the sum of the fibonacci series bounded at x and the same series including only equal results
{
Console.ForegroundColor = ConsoleColor.Green;
/// if a) current reached fiq-seq-iteration-number (FSIN)
/// is NOT equal to last signifacnt iteration,
/// and b) if showflavortext=true - display flavor text:
if (fibSeries.iterationReached != lastIteration && showFlavorText)
{
Console.WriteLine(">>The Fibonacci Series go up to {0} <<\n", seriesMaxNumeric);
Access.PrintList(fibSeries.fibonacciSeries, 5);
Console.Write("\n>>The sum of Fibonacci series up to is {0} <<\n", seriesMaxNumeric);
Access.PrintList(equalFibs, 5);
Console.Write(">>The sum of the Fibonacci Series including only equal results is {0} <<<\n", sumOfEqualFibInts);
Console.WriteLine("Analysis:\n All fibs minus the sum of equal fibs: {0} - {1} = {2}\n" +
" All fibs divided by two: {0} / 2 = {3}\n", sumOfFibInts, sumOfEqualFibInts, sumOfFibInts - sumOfEqualFibInts, sumOfFibInts / 2);
}
var interestingNumberSet = new FibonacciGainQualities(fibSeries.iterationReached, fibSeries.fibonacciSeries.Last <int>(), sumOfFibInts, sumOfEqualFibInts);
if (interestingNumbers.Count < 1) // if the list is empty, simply add new FibonacciGainQualities item to it
{
interestingNumbers.Add(interestingNumberSet);
}
else if (interestingNumbers.Last().iterationNumber != interestingNumberSet.iterationNumber) // else, make sure a relevantly similar item is not already on the list; then add it
{
interestingNumbers.Add(interestingNumberSet);
lastIteration = fibSeries.iterationReached;
}
}
else
{
if (fibSeries.iterationReached != lastIteration && showFlavorText)
{
Console.ForegroundColor = ConsoleColor.DarkRed;
Console.WriteLine("\nSeries with max {0} yielded result not of interest.", seriesMaxNumeric);
Console.WriteLine("\n All fibs minus the sum of equal fibs: {0} - {1} = {2}" +
"\n All fibs divided by two: {0} / 2 = {3}\n", sumOfFibInts, sumOfEqualFibInts, sumOfFibInts - sumOfEqualFibInts, sumOfFibInts / 2);
lastIteration = fibSeries.iterationReached;
}
}
Console.ResetColor();
if (!trueADDorFalsePRODUCT)
{
seriesMaxNumeric = seriesMaxNumeric * productFactor;
if (seriesMaxNumeric * productFactor >= Int32.MaxValue || seriesMaxNumeric * productFactor < 0)
{
Console.WriteLine("Incrementing series of Fibonacci Number ended to prevent value overflow error,\n" +
"with last functional max being {0}", seriesMaxNumeric);
Console.WriteLine("Info: << seriesMaxNumeric * productFactor >= Int32.MaxValue >> || << seriesMaxNumeric * productFactor < 0 >> {0}\n", seriesMaxNumeric);
Console.WriteLine("[{0}] Rounds done. Returning list of {1} interesting numbers.\n", i, interestingNumbers.Count);
break;
}
}
else
{
seriesMaxNumeric = seriesMaxNumeric + productFactor;
}
if (/*i%100==0 |*/ i == numberOfRounds - 1) // chopping up the number of feedback reports the user gets, here by a factor 10
{
Console.WriteLine("[{0}] Rounds done. Returning list of {1} interesting numbers", i, interestingNumbers.Count);
}
}
//Console.WriteLine("[{0}] Rounds done. Returning list of {1} interesting numbers", i, interestingNumbers.Count);
return(interestingNumbers);
}