olymmath

TW-TST 2001 Problem 1

    Let AA be a set with at least 33 integers, and let MM be the maximum element in AA and mm the minimum element in AA . it is known that there exist a polynomial PP such that: m<P(a)<Mm<P(a)<M for all aa in AA . And also p(m)<p(a)p(m)<p(a) for all aa in A−(m,M)A-(m,M) . Prove that n<6n<6 and there exist integers bb and cc such that p(x)+x2+bx+cp(x)+x^2+bx+c is cero in AA .

    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 tw-tst/2001/p1 · Tag 3J54STE87V · Edit this page on GitHub · Keys: j next, k previous