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)

    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

    Locator isl/2006/a2 · Tag TC10QGPHRF · Edit this page on GitHub · Keys: j next, k previous