MathDB
Miklos Schweitzer 1951_11

Source:

October 8, 2008
algebrapolynomialabsolute valuealgebra proposed

Problem Statement

Prove that, for every pair n n, rr of positive integers, there can be found a polynomial f(x) f(x) of degree n n with integer coefficients, so that every polynomial g(x) g(x) of degree at most n n, for which the coefficients of the polynomial f(x)\minus{}g(x) are integers with absolute value not greater than r r, is irreducible over the field of rational numbers.