olymmath

IMO 1999

International Mathematical Olympiad 1999.

Official paper

The official paper in 1 language

English

Day 1

Problem 2

  • Day 1

Let n≥2n \geq 2 be a fixed integer. Find the least constant CC such the inequality

∑i<jxixj(xi2+xj2)≤C(∑ixi)4\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C \left(\sum_{i}x_{i} \right)^4

holds for any x1,…,xn≥0x_{1}, \ldots ,x_{n} \geq 0 (the sum on the left consists of (n2)\binom{n}{2} summands). For this constant CC , characterize the instances of equality.

Attachments:

imo99lgo.gif

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Find all the pairs of positive integers (x,p)(x,p) such that p is a prime, x≤2px \leq 2p and xp−1x^{p-1} is a divisor of (p−1)x+1(p-1)^{x}+1 .

Attachments:

imo99lgo.gif

Answer, solutions and source