Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 1, printed p. 4 (PDF p. 5) of the 22 May 2001 author manuscript.
Statement
For each positive integer with , some polynomial
makes reducible for every integer ; reducibility is over the rationals, as the paper's problem is posed (p. 1). Here the source uses for polynomials with positive integral coefficients.
The positive-coefficient condition replaces the usual nontriviality condition in the source's formulation.
Proof pointer. Printed pp. 12--13 (PDF pp. 13--14) apply Theorem 3 to a system built from the repeated-modulus covering of Theorem 4. Its proof was not reconstructed or independently checked here.
Graph