Generated a list of primes from this C++ code: ---------------------------------------------------------------- #include <fstream> #include <cmath> using namespace std; bool isPrime(int p) { bool result = true; if (p < 2) { result = false; } else { int stop = (int)(sqrt(p + .5)); for (int d = 2; d <= stop; d++) { if (p % d == 0) { result = false; break; } } } return result; } int main() { ofstream outputFile; outputFile.open("PrimeNumbers300000.txt"); for (int i = 2; i <= 300000; i++) { if (isPrime(i)) { outputFile << i << endl; } } outputFile.close(); return 0; } -------------------------------------------------------------------
Stole the idea from @CatsUnited
