Consider all the natural numbers up to 1000 ending in the number n, which has a value in the set (1, 3, 7, 9). Calculate n^2-2 for each individual value of n up to 1000 and check if the result is prime. Save the set of these prime results for n=1, then another set for n=3, another set for n=7, and finally a set for n=9. Compare these sets quantitatively to determine how many primes they contain and list the results.
Up to 1000: Number of primes for n = 1: 30 Number of primes for n = 3: 32 Number of primes for n = 7: 33 Number of primes for n = 9: 27
Up to 10000: Number of primes for n = 1: 228 Number of primes for n = 3: 230 Number of primes for n = 7: 237 Number of primes for n = 9: 228
Up to 100000: Number of primes for n = 1: 1797 Number of primes for n = 3: 1837 Number of primes for n = 7: 1731 Number of primes for n = 9: 1774
Up to 1,000,000: Number of primes for n = 1: 14452 Number of primes for n = 3: 14592 Number of primes for n = 7: 14139 Number of primes for n = 9: 14261
Up to 10,000,000: Number of primes for n = 1: 1141550 Number of primes for n = 3: 1145834 Number of primes for n = 7: 1124059 Number of primes for n = 9: 1129097
The results continue to show a general trend of similar growth among prime sets for different values of n. However, the differences between the sets further increase as the range of values expands.