Prime generators on quadratic irreducible polynomials
This is a collection of different polynomials of the form f(n)=4n²+bn+c .
The searched polynomials should fulfill the following conditions:
The polynomial should be irreducible.
The term abs(c) should be a prime which is a limitiation.
Every polynomial should construct a special infinite sequence of primes by the following described algorithm
The algorithm
The following described algorithm is the simplest algorithm which calculates an infinite sequence of primes.
The algorithm can be improved of course by several means, but for a simple understanding the algorithm is limited to this simple form:
All positiv values f(n)=abs(n²+c) for n=0 up to n_max with n element N are precalculated.
All even values of f(n) are devided by 2 until they are odd.
for n=0 : f(0)=abs(c) and the prime abs (c) is sieved out for the values of f(0+k*(abs(c))) for k=1, 2, 3, 4, etc.
for n=1 : if f(n)=1 nothing is made
if f(n)>1=p, p is a prime and is sieved out
for the values of f( n+k*p)) for k=1, 2, 3, 4, etc. and
for the values of f(-n+k*p)) for k=1, 2, 3, 4, etc.
n is increased by one and the last step is repeated until n=n_max.
