Polynomial

[desert heart]

I think the idea is easy. Suppose such a polynomial exists. Take some point s>m. Then p(s)=q is prime. For any integer n, p(s+qn) is divisible by q, i.e., it is of the form qr. However, it is impossible for r to be -1 or 1 for infinitely many n, if p(x) is fixed and nonconstant.

I think they forgot to mention that p(x) must be non-constant

[violet furnace]

thank u

[ocean dew]

because of the structure of polinomials with integer coeficients you can say that if:

p(k)=q
with q been a prime
p(k+q)≡p(k)≡q(modq)

[violet furnace]

yeah ik i was js overcomplicating it and doing

some gobbldygook method

.close