olymmath

ISL 2006 A2

The sequence of real numbers a0,a1,a2,…a_{0}, a_{1}, a_{2}, \ldots is defined recursively by a0=−1,∑k=0nan−kk+1=0 for n≥1a_{0}=-1, \sum_{k=0}^{n} \frac{a_{n-k}}{k+1}=0 \text { for } n \geq 1 Show that an>0a_{n}>0 for n≥1n \geq 1. (Poland)

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

Official text: IMO 2006 Shortlist booklet, page 10.

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/2006/a2 · Tag TC10QGPHRF · Edit this page on GitHub · Keys: j next, k previous