olymmath

ISL 2009 N6

Let kk be a positive integer. Show that if there exists a sequence a0,a1,…a_{0}, a_{1}, \ldots of integers satisfying the condition an=an−1+nkn for all n≥1a_{n}=\frac{a_{n-1}+n^{k}}{n} \text { for all } n \geq 1 then k−2k-2 is divisible by 3 .

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2009 Shortlist booklet, page 13.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2009/n6 · Tag VRXD08VEYZ · Edit this page on GitHub · Keys: j next, k previous