olymmath

BG-MO 2018 Problem 5

    Given a polynomial P(x)=adxd+…+a2x2+a0P(x)=a_{d}x^{d}+ \ldots +a_{2}x^{2}+a_{0} with positive integers for coefficients and degree d≥2d\geq 2 . Consider the sequence defined by b1=a0,bn+1=P(bn)b_{1}=a_{0} ,b_{n+1}=P(b_{n}) for n≥1n \geq 1 . Prove that for all n≥2n \geq 2 there exists a prime pp such that pp divides bnb_{n} but does not divide b1b2…bn−1b_{1}b_{2} \ldots b_{n-1} .

    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 bg-mo/2018/p5 · Tag ZQ7D6TGD0V · Edit this page on GitHub · Keys: j next, k previous