olymmath

USAMO 1995 Problem 4

a0,a1,a2,…a_{0}, a_{1}, a_{2}, \ldots is an infinite sequence of integers such that an−ama_{n}-a_{m} is divisible by n−mn-m for all (unequal) nn and mm. For some polynomial p(x)\mathrm{p}(\mathrm{x}) we have p(n)>∣an∣\mathrm{p}(\mathrm{n})>\left|\mathrm{a}_{\mathrm{n}}\right| for all n\mathrm{n}. Show that there is a polynomial q(x)\mathrm{q}(\mathrm{x}) such that q(n)=\mathrm{q}(\mathrm{n})= ana_{n} for all nn.

Dataset text NuminaMath olympiads. 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 usamo/1995/p4 · Tag KZ4AG9CVRT · Edit this page on GitHub · Keys: j next, k previous