Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $a,b,c \ge 0$ with a series such that

$a_1 = 0$

$a_i \le a + b(c + a_{i-1})a_{i-1}$

I am looking for an upper bound on $a_i$ (tight as possible) in terms of $a$,$b$,$c$ and $i$.

share|cite|improve this question
Since the rhs is increasing in $a_{i-1}$, shouldn't $a_i = a+b(c+a_{i-1})a_{i-1}$ be the extreme case? – Ilya May 31 '12 at 16:22
This looks like a sequence, not a series, to me. Am I mistaken? – mixedmath May 31 '12 at 16:24
@mixedmath I can't remember any reference now but I have seen that usage of "series" before. – AD. May 31 '12 at 16:27
@kloop Do you mean asymptotic bound? – AD. May 31 '12 at 16:27
@A.D. no, I mean something like the following:… – kloop May 31 '12 at 16:28

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.