Some results for the irreducibility of truncated binomial expansions (Q1786689)

For positive integers \(k\) and \(n\) with \(k\leq n-1\), let \(P_{n,k}(x)\) denote the polynomial \(\sum_{j=0}^k \binom{n}{j} x^j \), where \(\binom{n}{j} = \frac{n!}{j!(n-j)!}\). It is known (cf. [\textit{S. K. Khanduja} et al., J. Number Theory 131, No. 2, 300--308 (2011; Zbl 1213.11185)]) that \(P_{n,k}(x)\) is irreducible over the field \(\mathbb{Q}\) of rational numbers for \(2\leq 2k \leq n < (k+1)^3\). In this paper, the authors pushing the arguments of the above mentioned paper, extend this result and prove that if \(2\leq 2k \leq n < (k+1)^{e+1}\) for some positive integer \(e\) and the smallest prime factor of \(k\) is greater than \(e\), then there exists an explicitly constructible constant \(C_e\) depending only on \(e\) such that the polynomial \(P_{n,k}(x)\) is irreducible over \(\mathbb{Q}\) for \(k\geq C_e\). The proof is written in a lucid manner.