Sequence \(a_{n}\) where \(n = 1, 2, 3, \ldots\) is defined by \(a_{1} > 0\) and \(a_{n+1} = c(a_{n})^2 + a_{n}\) for \(n = 1,2,3,\ldots\) where \(c\) is constant, show that:

\(1.\) \( a_{n} \geq \sqrt{c^{n+1}n^n(a_{1})^{n+1}}\)

\(2.\) \(a_{1} + a_{2} + a_{3} + \ldots + a_{n} > n(na_{1} - \frac{1}{c})\) for \(n ∈ ℕ\)

No vote yet

14 votes

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestNumber \(1\) isn't true for any \(c\), take \(n=1\), then \(1.\) reduces to

\(a_1\ge c a_1\)

, which is only true if \(c \le 1\).

Log in to reply

And what's wrong with c being less than or equal to 1?

Log in to reply

Well the wording of the problem would make one assume that it works for any constant...

Log in to reply

Log in to reply

True that!

@Fariz , you must be sure of the validity before posting.

Log in to reply