Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{ (f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of real roots of $g(x)=\sum_{ k=0}^s t_{ s-k} x^{ s-k}$. For any $\xi > | \beta_m |$, if $n-s$ is odd then the number of real roots of $f(\xi, x)$ is $\gamma+1$, and if $n-s$ is even then the number of real roots of $f(\xi, x)$ is $\gamma$, $\gamma+2$ if $t_s>0$ or $t_s < 0$ respectively. A special case of the above result is constructing a family of totally complex polynomials which are reducible over $\mathbb Q$.
Categories: math.NT math.RA