This continues my older primes page. I have collected to this page some more special type of primes and polynomials that generates primes.

Primes that are form 10^{x}+y, where x would be something very big and y either 1, 3, 7 or 9 to make it prime.
So for example 10^{17}+3 = 100 000 000 000 000 003, but much, much more zeroes.

Here are some highest ones:

10^{4562} + 9

10^{6344} + 7

10^{7668} + 3

Following are not certainly primes but there is high probability for that:

10^{26927} + 3

10^{30221} + 7

10^{31810} + 9

Interestingly I haven't found any similar primes ending to number 1, except 11 and 101. Is there any or is it proven there can't be any (and if so, why)?

Primes that are form (10^{x}-1)/9, where x is something very big. This generates numbers that contains only ones.
For example (10^{19}-1)/9 = 1 111 111 111 111 111 111, which is prime.
Obviously numbers with only ones can be primes, number containing only threes could be divided by 3 etc.

These seem to be much harder to find than "zeroes" type above. Here are all 6 I've found:

(10^{2} - 1) / 9

(10^{19} - 1) / 9

(10^{23} - 1) / 9

(10^{317} - 1) / 9

(10^{1031} - 1) / 9

(10^{49081} - 1) / 9 (not certainly prime but there is high probability for that)

2, 19, 23, 317, 1031, 49081. Is there any logic in those? Other than that they are also primes :-)

In case someone is wondering, I was running my program for all possible values up to that 49081. No other than those 6 were even probable prime. I later found this page about repunit primes. See that page for even bigger similar probable primes found.

Polynomials where all multipliers are 1. Unfortunately these do not work with n=0, since 1 itself isn't prime.

n^{7} + n^{4} + n^{2} + n + 1 n=[1..5]

n^{11} + n^{10} + n^{9} + n^{8} + n^{7} + n^{5} + 1 n=[1..7]

n^{16} + n^{15} + n^{10} + n^{9} + n^{8} + n^{6} + n^{5} + n^{3} + n^{2} + n + 1 n=[1..8]

n^{25} + n^{22} + n^{21} + n^{20} + n^{19} + n^{16} + n^{15} + n^{13} + n^{12} + n^{11} + n^{10} + n^{8} + n^{7} + n^{5} + n^{4} + n + 1 n=[1..9]

Usually any prime generating polynomial generates rather small primes. This is expected since small numbers are much more likely to be primes than big ones. Here is some polynomials with big exponents and results are getting huge really fast.

n^{58} + n^{50} + 101 n=[0..3]

n^{81} + n^{58} + 857 n=[0..4]

n^{152} + n^{100} + 11 n=[0..4]

n^{367} + n^{362} + 17 n=[0..4]

From last one, with value n=4, result is: 90 456 697 114 872 591 699 151 142 601 866 986 247 973 054 988 995 842 587 515 218 097 945 661 753 757 139 450 110 024 031 878 460 840 474 072 254 241 909 265 393 011 852 735 167 210 041 163 028 615 597 492 471 611 437 305 305 750 737 092 121 072 031 909 872 401 602 920 806 418 550 777 446 417

Few ones where I've bump into while playing around with these. These makes lots of primes but same ones are repeating.

n^{4} - 94*n^{3} + 2999*n^{2} - 37130*n + 153313 n=[0..47] (22 distinct)

n^{4} - 102*n^{3} + 4502*n^{2} - 96951*n + 733517 n=[0..51] (26 distinct)

n^{4} - 110*n^{3} + 4841*n^{2} - 99880*n + 806371 n=[0..55] (28 distinct)

n^{2} - 79*n + 1601 n=[0..79] (40 distinct)

One of my favorite pages with primes: Prime-Generating Polynomial

Another great page, this is for testing primality of huge numbers: Factorization using the Elliptic Curve Method

Simple and quick JavaScript test: Prime Curios!: A Primality Test

www.tiikoni.net/primes/special.php | Full page map | Copyright © Pasi Laaksonen |