There exists infinitely many primes where x is a prime, and ax^n +c is prime for all positive integers, where also all coefficients are positive integers, whose degrees are also all positive integers, wherence the polynomial must also not be factorable over the positive integers, and the GCD of (a,c) must equal one and whose difference between a and c or c and a if c>a or a>c, then a-c or c-a must equal an odd number. This conjecture further generalizes Dirlchlet’s theorem , the Sophie Germain conjecture,and the Bunyakovsky conjecture. To read up more on these conjectures and theorems I have referenced, I have included links to Wikipedia to help you out. As always I welcome the readers to prove this conjecture of mine.
https://en.wikipedia.org/wiki/Bunyakovsky_conjecture
https://en.wikipedia.org/wiki/Sophie_Germain_prime
https://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions
Nunghead
My Mathematics work and other extraneous diversions 