After creating some code, I’ve finally got my computer to calculate the first 30 Million Prime Numbers. It only took 8.3 hours, according to the timer I set up.<\/p>\n
<\/p>\n
Here’s my code:<\/p>\n
\r\nfrom timeit import default_timer\r\nstart = default_timer()\r\nimport math\r\ntext_file = open(\"10,000,000 to 20,000,000.txt\", \"w\")\r\ntext_file1 = open(\"10,000,000 to 20,000,000 with rowNumbers.txt\", \"w\")\r\ntext_file2 = open(\"20,000,000 to 30,000,000.txt\", \"w\")\r\ntext_file3 = open(\"20,000,000 to 30,000,000 with rowNumbers.txt\", \"w\")\r\ntext_output = open(\"Output.txt\", \"w\")\r\ntext_output.write(\"Started: \"+ str(default_timer() - start) + \" seconds\\n\")\r\n\r\nprimes = [2, 3]\r\nprint(\"This file was made for cornerspots.com\\n1. 2\\n2. 3\")\r\ntext_file.write(\"This file was made for cornerspots.com\\n10,000,000th prime to 20,000,000th prime\\n\")\r\ntext_file1.write(\"This file was made for cornerspots.com\\n10,000,000th prime to 20,000,000th prime\\n\")\r\ntext_file2.write(\"This file was made for cornerspots.com\\n10,000,000th prime to 20,000,000th prime\\n\")\r\ntext_file3.write(\"This file was made for cornerspots.com\\n10,000,000th prime to 20,000,000th prime\\n\")\r\nnumber = 1\r\nrowNumber = 2\r\n\r\nwhile rowNumber < 30000000: #30,000,000\r\n isPrime = True\r\n number += 2\r\n\r\n for prime in primes:\r\n # if number is bigger than the sqrt of num we're checking\r\n if prime > math.sqrt(number):\r\n break\r\n # is not a prime\r\n if number % prime == 0:\r\n isPrime = False\r\n break\r\n\r\n if isPrime:\r\n rowNumber += 1\r\n primes.append(number)\r\n print(str(rowNumber) + \". \" + str(number))\r\n if (rowNumber >= 10000000 and rowNumber <= 20000000):\r\n text_file.write(str(number) + \"\\n\")\r\n text_file1.write(str(rowNumber) + \". \" + str(number) + \"\\n\")\r\n\r\n if (rowNumber >= 20000000 and rowNumber <= 30000000):\r\n text_file2.write(str(number) + \"\\n\")\r\n text_file3.write(str(rowNumber) + \". \" + str(number) + \"\\n\")\r\n \r\ntext_file.close()\r\ntext_file1.close()\r\ntext_file2.close()\r\ntext_file3.close()\r\ntext_output.write(\"Ended: \" + str(default_timer() - start) + \"seconds\")<\/pre>\n<\/code><\/p>\n
<\/p>\n
Now I know that there was probably an easier way to do this, but I decided to split up the files into 10 Million each because I noticed that notepad was starting to get a little laggy when I
\nIf you're looking for the first 10 Million, look at the post right before this one. Also, if you use notepad++ to open the files, then there is almost no lag.
\nIf you try to open this with normal notepad, you have to wait around 1 minute for the whole thing to load. If notepad says it's not responding, just wait. It will open eventually.<\/p>\n
10MillionthPrime_To_20MillionthPrime_withoutrowNumbers<\/a><\/p>\n10MillionthPrime_To_20MillionthPrime_withRowNumbers<\/a><\/p>\n20MillionthPrime_To_30MillionthPrime_withoutRowNumbers<\/a><\/p>\n