public static int SearchCoefficientsOfQuadricExpressionContainLongestPrimeSequence(List <QuadricExpression> quadricExpressions) { int counter = 0; int longestPrimeSequenceCount = 0; QuadricExpression BestQuadricExpression = new QuadricExpression(1, 1); foreach (var quadricExpression in quadricExpressions) { counter = 0; while (IsPrime(CalculateExpression(quadricExpression, counter))) { counter++; } if (counter > longestPrimeSequenceCount) { longestPrimeSequenceCount = counter; BestQuadricExpression = quadricExpression; } } return(BestQuadricExpression.A * BestQuadricExpression.B); }
public static long CalculateExpression(QuadricExpression QE, int n) { return(n * n + QE.A * n + QE.B); }