KöMaL 2009 A472
Call a finite sequence ( (),...,() ) of polynomials with integer coefficients Euclidean if there exist polynomials with integer coefficients such that ()=()()+...+()() is a common divisor of (),...,(), i.e. there are polynomials with integer coefficients for which ()=()() for every 1. Prove that whenever are polynomials with integer coefficients and every two of them form a Euclidean pair, then the sequence is Euclidean as well.
Official text KöMaL. 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.
Similar problems
These problems have the most words in common with this statement.