public double Solve() { var helper = new MathHelper(); double result = 0; for (var i = 2; i < 2000000; i++) { if (helper.IsPrime(i)) result = result + i; } return result; }
public double Solve() { var test = 1; var count = 0; var lastPrime = 0; var helper = new MathHelper(); while (count < 10001) { if (helper.IsPrime(test)) { lastPrime = test; count++; } test += 2; } return lastPrime; }