INEQUALITY'S BLOG

July 31, 2010

(Van Khea):Problem 026

Filed under: Uncategorized — KKKVVV @ 9:08 am

Let a, b, c, k>0; a\leq b\leq c. Prove that:

\displaystyle \frac{a^k}{b}+\frac{b^k}{c}+\frac{c^k}{a}\geq \frac{b^k}{a}+\frac{c^k}{b}+\frac{a^k}{c}

Proof

Let \displaystyle f(x)=\frac{1}{x^{\frac{1}{k}}} ; k>0

\displaystyle f''(x)=\frac{1}{k}(\frac{1}{k}+1)x^{-\frac{1}{k}-2}>0

From the conditional a\leq b\leq c ; k>0\Longrightarrow a^k\leq b^k\leq c^k

From the inequality by Van Khea for m=n=p\neq 0a^k\leq b^k\leq c^k and f''(x)>0 we get:

(c^k-b^k)f(a^k)-(c^k-a^k)f(b^k)+(b^k-a^k)f(c^k)\geq 0

\displaystyle \Longrightarrow \frac{c^k-b^k}{a}-\frac{c^k-a^k}{b}+\frac{b^k-a^k}{c}\geq 0

\Longrightarrow\displaystyle \frac{a^k}{b}+\frac{b^k}{c}+\frac{c^k}{a}\geq \frac{b^k}{a}+\frac{c^k}{b}+\frac{a^k}{c}

Therefor the proof is completed.

See also the inequality by VanKhea

Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Create a free website or blog at WordPress.com.

%d bloggers like this: