olymmath

DE-MO 2011 Problem 6

    Let p>2p>2 be a prime. Define a sequence (Qn(x))(Q_{n}(x)) of polynomials such that Q0(x)=1,Q1(x)=xQ_{0}(x)=1, Q_{1}(x)=x and Qn+1(x)=xQn(x)+nQn−1(x)Q_{n+1}(x) =xQ_{n}(x) + nQ_{n-1}(x) for n≥1.n\geq 1. Prove that Qp(x)−xpQ_{p}(x)-x^p is divisible by pp for all integers x.x.

    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 de-mo/2011/p6 · Tag JDXFP47B3M · Edit this page on GitHub · Keys: j next, k previous