Results 1 to 5 of 5

Math Help - Recurrence Relation?

  1. #1
    Junior Member
    Joined
    Oct 2007
    Posts
    48

    Question Recurrence Relation?

    can u plz help me to solve recurrence relation?

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

    ≥ is giving latex error.
    Last edited by cu4mail; January 7th 2008 at 10:52 PM. Reason: ≥ updated
    Follow Math Help Forum on Facebook and Google+

  2. #2
    is up to his old tricks again! Jhevon's Avatar
    Joined
    Feb 2007
    From
    New York, USA
    Posts
    11,663
    Thanks
    3
    Quote Originally Posted by cu4mail View Post
    ≥ is giving latex error.
    use \ge
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor
    Opalg's Avatar
    Joined
    Aug 2007
    From
    Leeds, UK
    Posts
    4,041
    Thanks
    7
    Quote Originally Posted by cu4mail View Post
    ≥ 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 ≥ will not work. However, if you use the equivalent numerical character entity reference ≥ 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 ∞ won't work, but ∞ comes out as ∞.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Junior Member
    Joined
    Oct 2007
    Posts
    48

    Question

    Thanks for help on using editor.

    Anyone please help on solving the question?
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor
    Opalg's Avatar
    Joined
    Aug 2007
    From
    Leeds, UK
    Posts
    4,041
    Thanks
    7
    Quote Originally Posted by cu4mail View Post
    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.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Recurrence relation
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: October 16th 2011, 12:27 AM
  2. recurrence relation
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: October 18th 2010, 03:15 AM
  3. Recurrence Relation HELP
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: May 3rd 2009, 02:18 PM
  4. recurrence relation
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: April 15th 2009, 07:20 PM
  5. Recurrence relation
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: November 16th 2008, 09:02 AM

Search Tags


/mathhelpforum @mathhelpforum