Asked by mathslover
Find the largest possible number of distinct integer values {x_1,x_2,…,x_n}, such that for a fixed reducible degree 4 polynomial with integer coefficients, |f(x_i)| is prime for all i?
Answers
Answered by
subharthi
its 4
There are no AI answers yet. The ability to request AI answers is coming soon!