MathDB
Minimum upper bound on reciprocal terms of a recurrence

Source: Balkan MO ShortList 2010 A2

April 5, 2020

Problem Statement

Let the sequence (an)nN(a_n)_{n \in \mathbb{N}}, where N\mathbb{N} denote the set of natural numbers, is given with a1=2a_1=2 and an+1a_{n+1} == an2a_n^2 - an+1a_n+1. Find the minimum real number LL, such that for every kk \in N\mathbb{N} \begin{align*} \sum_{i=1}^k \frac{1}{a_i} < L \end{align*}