Question
Let's say I define a polynomial $P(x)$ whose roots $\alpha_i$ and degree $> 1$. We also add constraint that the coefficient of the highest power of $P(x)$ is $1$ and all other coefficients are integers.
when $P(0) \neq 0$. Then:
$$ \frac{P(|P(0)|)}{P(0)} = \prod_{i=1}^{\deg P(x)} (1 - \frac{P(0)}{\alpha_i}) $$
where |x| is the modulus of x. Let, the number of prime factors of ${P(|P(0)|)}/{P(0)}$ be $z$. Then if,
$$ \deg P(x) > z$$
and $P(2) \neq 0$ this implies $P(x)$ has some irrational roots.
Example
$$P(x) = x^4 -x^3 + 3x^2 + 3$$
thus,
$$\frac{P(|P(0)|)}{P(0)} = 7 \times 2 \times 2$$
Hence, the number of primes are $3$ but $\deg P(x) = 4 > 3$. We conclude, $P(x)$ has irrational roots.
Question
Is it possible to quantify how often a polynomial with some irrational roots of the form $P(x)$ satisfies $ \deg P(x) > z$?