Results 1 to 2 of 2

Math Help - Inequality help

  1. #1
    Newbie
    Joined
    Jul 2013
    From
    New Delhi
    Posts
    10

    Inequality help

    Wasn't sure where to put this...profound apologies if this is in the wrong forum...

    Suppose there are $n$ distinct odd, positive integers $\{a_i\}_{i=1}^n$ where the absolute value of the difference between each pair of numbers is distinct i.e. each $|a_k - a_i|, \ 1\leq k < i \leq n$ is distinct.

    Prove that $$\sum_{i=1}^n a_i \geq \tfrac{1}{3} n(n^2 + 2)$$

    I tried doing this by induction and have gotten to the stage of my induction hypothesis but am not sure how to proceed. I have tried to prove that $a_{k+1} \geq 1 + k + k^2$ (as this would help yield the result for my induction) but, again, no success....

    Can anyone give me a hint as to how I would go about the induction (or even if induction is the correct way and I should try a different approach)?

    Thank you
    Last edited by Diadem; February 23rd 2014 at 03:07 AM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Dec 2012
    From
    Athens, OH, USA
    Posts
    639
    Thanks
    257

    Re: Inequality help

    Hi,
    You're definitely on the right track. The attachment shows an outline of a proof. If you have any questions, post again.

    Inequality help-mhfnumbertheory7.png
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: October 26th 2013, 02:10 AM
  2. Replies: 2
    Last Post: January 11th 2011, 08:20 PM
  3. Replies: 3
    Last Post: December 12th 2010, 01:16 PM
  4. Inequality
    Posted in the Differential Geometry Forum
    Replies: 1
    Last Post: September 29th 2010, 06:42 AM
  5. Inequality. yup.
    Posted in the Algebra Forum
    Replies: 2
    Last Post: November 9th 2008, 07:34 AM

Search Tags


/mathhelpforum @mathhelpforum