olymmath

IR-MO 2003 Problem 7

    f1,f2,…,fnf_{1},f_{2},\dots,f_{n} are polynomials with integer coefficients. Prove there exist a reducible g(x)g(x) with integer coefficients that f1+g,f2+g,…,fn+gf_{1}+g,f_{2}+g,\dots,f_{n}+g are irreducible.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ir-mo/2003/p7 · Tag 44CXTFT23Y · Edit this page on GitHub · Keys: j next, k previous