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.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Consider the function f(x)=x+x1=xx+1,x∈(0,+∞). It is easy to verify that f is non-decreasing on (1,+∞) and that f(x)=f(x1) for all x>0. Furthermore, from the given conditions, it follows that only x1 can be less than 1 and that x2+11≤1−x1+11=x1+1x1. Hence, x11≤x2. It is now clear that (for both cases 1≤x1 and x<1) that
f(x1)=f(x11)≤f(x2)≤…≤f(xn).
This means that the sequence (xkxk+1)k=1n is non-decreasing. Thus, by Chebyshev's inequality, we have
Equality is attained if and only if x1+11=…=xn+11, or x1x1+1=…=xnxn+1, which implies that x1=x2=…=xn. Thus equality holds if and only if x1=x2=…=xn=n−1.□
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Solution: It suffices to show that
n(k=1∑nxk1)≤k=1∑n(xk+xk1),
or equivalently
n(k=1∑nxk1)≤(k=1∑nxkxk+1)(k=1∑nxk+11).
Consider the function f(x)=x+x1=xx+1,x∈(0,+∞). It is easy to verify that f is non-decreasing on (1,+∞) and that f(x)=f(x1) for all x>0. Furthermore, from the given conditions, it follows that only x1 can be less than 1 and that x2+11≤1−x1+11=x1+1x1. Hence, x11≤x2. It is now clear that (for both cases 1≤x1 and x<1) that
f(x1)=f(x11)≤f(x2)≤…≤f(xn).
This means that the sequence (xkxk+1)k=1n is non-decreasing. Thus, by Chebyshev's inequality, we have
n(k=1∑nxk1)≤(k=1∑nxkxk+1)(k=1∑nxk+11),
and we are done.
Equality is attained if and only if x1+11=…=xn+11, or x1x1+1=…=xnxn+1, which implies that x1=x2=…=xn. Thus equality holds if and only if x1=x2=…=xn=n−1.□