Results 1 to 2 of 2

Math Help - Sequence Inequality Proof

  1. #1
    Member
    Joined
    Nov 2010
    Posts
    86

    Sequence Inequality Proof

    Please help me with this proof that follows:


    Let x-sub-j from j=1 to infinity and y-sub-j from j=1 to infinity be sequences in the Integers such that x-sub-j <= y-sub-j for all j in the Natural numbers. Then for all k in the Naturals, prove that:

    Σ from j=1 to k of (x-sub-j) <= Σ from j=1 to k of (y-sub-j)


    Can we use induction here? Or recursion? Thanks a lot in advance!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor Bruno J.'s Avatar
    Joined
    Jun 2009
    From
    Canada
    Posts
    1,266
    Thanks
    1
    Awards
    1
    Please use LaTeX to write up your post, because it's quite unreadable.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Inequality proof.
    Posted in the Algebra Forum
    Replies: 1
    Last Post: May 16th 2011, 04:15 PM
  2. Sequence inequality
    Posted in the Differential Geometry Forum
    Replies: 4
    Last Post: March 14th 2010, 09:02 PM
  3. Sequence Series and Inequality
    Posted in the Calculus Forum
    Replies: 1
    Last Post: May 18th 2008, 05:16 AM
  4. Convergent Sequence Inequality
    Posted in the Calculus Forum
    Replies: 2
    Last Post: February 8th 2007, 01:22 PM
  5. Cauchy Sequence Inequality
    Posted in the Advanced Math Topics Forum
    Replies: 7
    Last Post: June 4th 2006, 03:19 PM

Search Tags


/mathhelpforum @mathhelpforum