Home
Welcome to the Prime Gen Search ! This project's goal is to find polynomials that take on prime values for the first few values of x! Some examples:
f(x) = 2x + 3, f(x) is prime for x = 0, 1, 2
f(x) = 41 + x + x^2, f(x) is prime for x = 0, 1, 2, ... 38, 39 (Euler)
The above is a very good example of what we try to find here.
The above function is the only quadratic (with all coefficients under 100) that has at least 40 primes in a row!
What we've found: https://github.com/ChemicalDevelopment/PGS/wiki/Searches
Primes (https://en.wikipedia.org/wiki/Prime_number) are numbers that can't be made by multiplying two numbers, except for 1 and that number. The first few primes are 2, 3, 5, 7, 11, 13, 17. Prime numbers are essential in everyday life, whether you know it or not. Some of our basic concepts (such as dividing a pie into slices), and most advanced (cryptography, algebra) fields in maths research revolve around primes.
Polynomials (https://en.wikipedia.org/wiki/Polynomial) are a function. Sometimes, the first few values of a polynomial are primes. This project looks for polynomials that are prime for many values.