Here's a "teaser" inequality for an upcoming article I'm writing on an inequality I found that has this as an application:

Given that \(a_1,a_2,\ldots a_n\ge 1\) are reals then prove that \[(a_1^2-a_1+a_2)(a_2^2-a_2+a_3)\cdots (a_n^2-a_n+a_1)\ge a_1^2a_2^2\cdots a_n^2\]

For now, I wish to see solutions with inequalities we currently have. Good luck :3

*copy-pasted from AoPS lol*

## Comments

Sort by:

TopNewestI'm going to bed now, so maybe I'll try this later. I's just wondering if the following manipulations help!

Define \(b_i=a_i-1\) for all \(i\). Then we gotta prove that

\[\prod_{\text{cyc}}\left(a_1^2-a_1+a_2\right)=\prod_{\text{cyc}}\left(b_1^2+b_1+1+b_2\right)\ge\prod_{\text{cyc}}\left(b_1^2+b_1+1+b_1\right).\]

Can anyone finish this from here? – Jubayer Nirjhor · 2 years, 2 months ago

Log in to reply

– Daniel Liu · 2 years, 2 months ago

nice observation. for the n=2 case we can directly use C-S to prove it. it doewnt apply to higher cases thoughLog in to reply

– Calvin Lin Staff · 2 years, 2 months ago

Great observation. Which inequality allows you to justify that step?Log in to reply

Hi, just wondering. How do you save stuff to sets? I would press create new note, but it wouldn't save to the set. What am I doing wrong? – Nolan H · 2 years, 1 month ago

Log in to reply

@Calvin Lin I can't seem to solve this using Induction by the straightforward way... Can you try this out? – Daniel Liu · 2 years, 2 months ago

Log in to reply

If we insist on trying that, the straightforward way requires showing that

\[ \frac{ ( a_n^2 - a_n + a_{n+1} ) (a_{n+1}^2 - a_{n+1} + a_1 ) } { (a_n^2 - a_n + a_1 ) } \geq a_{n+1} ^2. \]

This is equal to

\[ ( a_1 - a_{n+1} ) ( a_n ^2 - a_n - a_{n+1}^2 + a_{n+1} ) ( a_n^2 - a_n + a_1 ) > 0 \]

which is not necessarily true. – Calvin Lin Staff · 2 years, 2 months ago

Log in to reply

A simple induction will do it, I guess – Bogdan Simeonov · 2 years, 2 months ago

Log in to reply

– Daniel Liu · 2 years, 2 months ago

Why don't you try the induction? You may be surprised.Log in to reply

Q.E.D

Is this solution correct?And how can we prove the inequality without induction?

EDIT:I've only proved the case when the reals are in ascending order.But isn't the value of the LHS minimal when this is the case? – Bogdan Simeonov · 2 years, 2 months ago

Log in to reply

– Calvin Lin Staff · 2 years, 2 months ago

I would have issues with assuming that they must have a certain order. It is (as yet) not obvious that this minimizes the LHS.Log in to reply

– Bogdan Simeonov · 2 years, 2 months ago

Yes, that is the main problem of my solution.I don't know if we can even fill the holeLog in to reply