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?

Answer 1

its 4