olymmath

MEMO 2021 T2

    Given a positive integer nn , we say that a polynomial PP with real coefficients is nn -pretty if the equation P(⌊x⌋)=⌊P(x)⌋P(\lfloor x \rfloor)=\lfloor P(x) \rfloor has exactly nn real solutions. Show that for each positive integer nn [list=a] [] there exists an n-pretty polynomial; [] any nn -pretty polynomial has a degree of at least 2n+13\tfrac{2n+1}{3} . [/list] (Remark. For a real number xx , we denote by ⌊x⌋\lfloor x \rfloor the largest integer smaller than or equal to xx .)

    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 memo/2021/t2 · Tag JCEN42J7Z9 · Edit this page on GitHub · Keys: j next, k previous