# Recurrence Relation?

• Jan 7th 2008, 09:34 PM
cu4mail
Recurrence Relation?
can u plz help me to solve recurrence relation?

$a_n = a_{n-1} + f(n)$ for $n \ge 1$ by substitution

&ge; is giving latex error.
• Jan 7th 2008, 09:38 PM
Jhevon
Quote:

Originally Posted by cu4mail
&ge; is giving latex error.

use \ge
• Jan 8th 2008, 12:25 AM
Opalg
Quote:

Originally Posted by cu4mail
&ge; is giving latex error.

There seems to be a quirk in the implementation of HTML used by this forum. You can get the character ≥ in the LaTeX environment by typing \ge, \geq or (my preference) \geqslant. But if you want it in HTML, typing &ge; will not work. However, if you use the equivalent numerical character entity reference &#38;#8805; you will get the symbol ≥.

The same applies to any other HTML character. You can get it by specifying the numerical character entity reference, but not by using the (abbreviated) name of the character. So for example &infin; won't work, but &#38;#8734; comes out as ∞.
• Jan 9th 2008, 03:42 AM
cu4mail
Thanks for help on using editor.

• Jan 9th 2008, 04:14 AM
Opalg
Quote:

Originally Posted by cu4mail
can u plz help me to solve recurrence relation?

$a_n = a_{n-1} + f(n)$ for $n \ge 1$ by substitution

$a_1 = a_0+f(1)$,
$a_2 = a_1+f(2) = a_0+f(1)+f(2)$,
$a_3 = a_2+f(3) = a_0+f(1)+f(2)+f(3)$,
...
$a_n = a_0+\sum_{k=1}^nf(k)$.

That's all you can say, unless you have further information about the function f.