olymmath

OBM 2014 Problem 4

    The infinite sequence P0(x),P1(x),P2(x),…,Pn(x),…P_0(x),P_1(x),P_2(x),\ldots,P_n(x),\ldots is defined as P0(x)=x,Pn(x)=Pn−1(x−1)⋅Pn−1(x+1),n≥1.P_0(x)=x, P_n(x) = P_{n-1}(x-1)\cdot P_{n-1}(x+1), n\ge 1. Find the largest kk such that P2014(x)P_{2014}(x) is divisible by xkx^k .

    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 br-obm/2014/p4 · Tag AKJFRF3FDP · Edit this page on GitHub · Keys: j next, k previous