Scribd
Upload
58 views2 pages

Igmo 2025 P5

The document presents a mathematical problem involving positive real numbers a, b, c, d, e, f and a real number k greater than 1, aiming to prove a specific inequality. It includes a key lemma that demonstrates a relationship between these variables and their transformations. The proof utilizes various mathematical concepts such as the Rearrangement Inequality and the AM-GM inequality to establish the validity of the original inequality.

Uploaded by

ramasavio007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views2 pages

Igmo 2025 P5

The document presents a mathematical problem involving positive real numbers a, b, c, d, e, f and a real number k greater than 1, aiming to prove a specific inequality. It includes a key lemma that demonstrates a relationship between these variables and their transformations. The proof utilizes various mathematical concepts such as the Rearrangement Inequality and the AM-GM inequality to establish the validity of the original inequality.

Uploaded by

ramasavio007
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

IGMO 2025 Problem 5

Rama Savio

February 2025

Problem 5:

Let a, b, c, d, e, f be positive real numbers with a ≤ b ≤ c ≤ d ≤ e ≤ f , and let k be a real number greater
than 1. We want to prove:
 35a
− 1 k 35b − 1 k 35c − 1

420(a−f ) 420(b−e) 420(c−d) k
k +k +k + 69 ≥ 24 + + .
k 35d − 1 k 35e − 1 k 35f − 1

Proof. Simplification

Let’s make things a bit easier to read. Set x = 35a, y = 35b, z = 35c, u = 35d, v = 35e, and w = 35f .
Since a through f are ordered, so are x through w: x ≤ y ≤ z ≤ u ≤ v ≤ w. The inequality becomes:
 x
k − 1 ky − 1 kz − 1

12(x−w) 12(y−v) 12(z−u)
k +k +k + 69 ≥ 24 + + .
ku − 1 kv − 1 kw − 1

A Key Lemma

Here’s a lemma that’ll be crucial:


kx −1
Lemma: If k > 1 and 0 < x ≤ u, then ku −1 ≤ ux .

1
kt −1
Proof of Lemma. Consider the function f (t) = t for t > 0. We’ll show f (t) is increasing. Taking the
derivative:
tk t ln(k) − (k t − 1)
f ′ (t) = .
t2
We want to show the numerator is positive. Let g(t) = tk t ln(k) − k t + 1. Then:
g ′ (t) = k t ln(k) + tk t (ln(k))2 − k t ln(k) = tk t (ln(k))2 .
Since k > 1 and t > 0, we see that g ′ (t) > 0. So, g(t) is strictly increasing. And g(0) = 0, so g(t) > 0 for
t > 0.

This means f ′ (t) > 0, and therefore, f (t) is strictly increasing. Since 0 < x ≤ u, we get f (x) ≤ f (u),
which is:
kx − 1 ku − 1
≤ .
x u
A little rearrangement gives us the lemma:
kx − 1 x
u
≤ .
k −1 u

Putting It Together

By our lemma, because x ≤ u, y ≤ v, and z ≤ w, we have:


kx − 1 x ky − 1 y kz − 1 z
≤ , ≤ , ≤ .
ku − 1 u kv − 1 v kw − 1 w
So,
kx − 1 ky − 1 kz − 1
  x y z
24 + + ≤ 24 + + .
ku − 1 kv − 1 kw − 1 u v w

1 1
Now, x ≤ y ≤ z and w ≤ v ≤ u1 . By the Rearrangement Inequality:
x y z x y z
+ + ≤ + + .
u v w w v u

Also, using AM-GM,


x−w
k 12(x−w) + 23 = k 12(x−w) + 1 + 1 + · · · + 1 ≥ 24k 2 .
| {z }
23 times

We get similar inequalities for the other pairs:


y−v z−u
k 12(y−v) + 23 ≥ 24k 2 , k 12(z−u) + 23 ≥ 24k 2 .
Adding these up:
 x−w y−v z−u

k 12(x−w) + k 12(y−v) + k 12(z−u) + 69 ≥ 24 k 2 + k 2 + k 2 .

And, we also have

kx − 1 ky − 1 kz − 1
x  
y z
k 12(x−w) + k 12(y−v) + k 12(z−u) + 69 ≥ 24 + + ≥ 24 u
+ v + w .
u v w k −1 k −1 k −1

Substituting back x = 35a, etc., we’ve proven the original inequality.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy