Infinite ABS Inequality

Prove that k=NNx+kkx2\sum_{k=-N}^{N}|x+k|-|k| \ge x^2 as NN\to \infty and find equality cases.

Details and Assumptions

We take the limit as NN approaches \infty because k=x+kk\displaystyle\sum_{k=-\infty}^{\infty}|x+k|-|k| is not well-defined.

#Algebra #AbsoluteValue #Parabola #InfiniteSum #EqualityCase

Note by Daniel Liu
6 years, 10 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Set : fn(x)=k=nnx+kk=x+k=1nx+k+xk2kf_n(x)= \sum_{k=-n}^n |x+k|-|k| =|x|+\sum_{k=1}^n |x+k|+|x-k| -2|k| Note that fn(x)=fn(x)f_n(-x)=f_n(x) for any real xx and any integer n>0n>0 then we only need to consider the case x0x\geq 0, and if kx>0k\geq x>0 then x+k+xk2k=0|x+k|+|x-k|-2|k|=0, therefore for n>xn>x : fn(x)=x+k=1x(x+k)+(xk)2k=x+2xxx(x+1).f_n(x)=x+\sum_{k=1}^{\lfloor x\rfloor}(x+k)+(x-k)-2 k= x+2x \lfloor x \rfloor -\lfloor x\rfloor (\lfloor x\rfloor +1).

Clearly now, fn(x)=xx+2xxx2f_n(x)= x-\lfloor x\rfloor +2x \lfloor x\rfloor-\lfloor x\rfloor^2 , the rest should follow easily.

fn(x)x2=xx+x(xx)+x(xx)=(xx)(1+xx)0f_n(x)-x^2 =x- \lfloor x\rfloor + x(\lfloor x\rfloor-x)+\lfloor x\rfloor(x-\lfloor x\rfloor)=(x-\lfloor x\rfloor)(1+\lfloor x\rfloor -x)\geq 0

Obviously, the equality is when xZx\in \mathbb{Z}.

Remark : you don't need nn\to \infty you just need nxn\geq x, and the latter series does make sense and it well-defined (though I'd use the term 'convergent' because well defined usually used for mono-valued functions).

Haroun Meghaichi - 6 years, 10 months ago

Log in to reply

How is the latter sequence defined? I seem to be getting different values for plugging in the same xx value if I compute it differently.

Daniel Liu - 6 years, 10 months ago

Log in to reply

Can you give me an example ?

Haroun Meghaichi - 6 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...