On the reducible quintic complete base polynomials (Q2378053)

Let \(B(x)= x^m +b_{m-1}x^{m-1}+\cdots + b_0 \in \mathbb Z[x]\). If every element in \(\mathbb Z[x]/(B(x)\mathbb Z[x])\) has a polynomial representative with coefficients in \(S=\{0,1,2,\ldots ,|b_{0}| - 1\}\) then \(B(x)\) is called a complete base polynomial (or CNS polynomial). The author proves that if \(B(x)\) is a completely reducible quintic polynomial with five distinct integer roots less than \(-1\), then \(B\) is a complete base polynomial. The same result for smaller degrees has been shown by \textit{D. M. Kane} [J. Number Theory 120, No. 1, 92--100 (2006; Zbl 1155.11017)] and \textit{A. Pethő} [``Notes on CNS polynomials and integral interpolation'', More sets, graphs and numbers. A salute to Vera Sós and András Hajnal. Bolyai Soc. Math. Stud.15, 301--315 (2006; Zbl 1136.11021)]. The author also reports on some experimental results using an implementation of \textit{H. Brunotte}'s algorithm [Acta Sci. Math. 67, No.3-4, 521--527 (2001; Zbl 0996.11067)] for deciding whether a given polynomial is a complete base polynomial.