From this day onwards I am going to post some proof problems.So that you can use these as practice problems for Olympiads. Let us start from basic level (not very basic though).
Find the minimum value of the expression below
Details and Assumptions:
Try to make different approaches.
Try more proof problems at Olympiad Proof Problems.
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
By using A.M−H.M we get , 4cyc∑a,b,c,d(b+c+da+1)≥∑cyca,b,c,d⎝⎜⎛1+b+c+da1⎠⎟⎞4 cyc∑a,b,c,d(b+c+da+1)≥316 cyc∑a,b,c,d(b+c+da)≥316−4 cyc∑a,b,c,d(b+c+da)≥34
Log in to reply
Nice solution. Do you have any more approaches?
Generalization:
i=1∑nj=1∑naj−aiai≥n−1n
When n=3 we get Nesbitt's inequality and when n=4 we get the inequality of this note.
Log in to reply
Proof:
cyc∑∑cyca−aa+n−n =cyc∑(∑cyca−aa+1)−n =cyc∑(∑cyca−a∑cyca−n =cyc∑a[∑cyca−a1]−n Titu's Lemma/Cauchy-Shwarz in engel form≥cyc∑a[(n−1)∑cycan2]−n =n−1n2−n =n−1n
@Nihar Mahajan nice idea..... how did you reach at this generalization?
Log in to reply
When I was proving this inequality , I felt a bit restricted , hence gave the generalization
So, here is my solution.
The given expression is homogeneous equation of degree 0. So, we can make a constraint a+b+c+d=1. And this constraint gives us that 0<a,b,c,d<1.
The expression transforms into a,b,c,d∑1−aa
Let f(x)=1−xx. Then we get that f′′(x)=−2(x−1)−3>0 for all x<1.
It implies that
f(a)+f(b)+f(c)+f(d)≥4f(4a+b+c+d)=4f(41)=34.
We can also solve it using Titu's Lemma. I am currently out of station. I would post the proof as soon as I return home.
1) put all 4 equal. To get minimum as 4/3. 2)put deniminator of all fractions as w,x,yand z. Now find each a,b,c and in terms of w,x,y and z. All these (w,x,y and z )are positive real no.s. now apply AM>=GM . 3) Rather finding out each a to d in terms of w,x,y and z , one can add +1 to each term take (a+b+c+d) common apply AM>=GM . Later substract 4 from answer
Log in to reply
'put all 4 equal. To get minimum as 4/3'.. WHY?
How can you say that minimum occurs when all the four quantities are equal? You should prove that.
What if we get maximum when all 4 are equal?