On the factorization of f(n) for f(x) in Z[x]

From MaRDI portal
Publication:2840301





Let \(f\) be a polynomial in \(\mathbb Z[X]\) with at least two distinct roots. In 1921 Siegel proved that the greatest prime factor of \(f(n)\) tends to infinity, the proof being ineffective. Here the authors consider a finite set \(S\) of prime numbers, as usual they define \(|m|_S = \prod_{p \in S} |m|_p^{-1}\) for a non-zero integer \(m\), and they prove effective upper bounds for \(|f(n)|_S\). This extends previous results of Stewart, and Bennett-Filatesa-Trifonov.











This page was built for publication: On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840301)