olymmath

ISL 2001

IMO Shortlist 2001.

Other problems

A2

Let a0,a1,a2,…a_0, a_1, a_2, \ldots be an arbitrary infinite sequence of positive numbers. Show that the inequality 1+an>an−12n1 + a_n > a_{n-1} \sqrt[n]{2} holds for infinitely many positive integers nn .

Attachments:

logo01.gif

A4

Find all functions f:R→Rf: \mathbb{R} \rightarrow \mathbb{R} , satisfying f(xy)(f(x)−f(y))=(x−y)f(x)f(y)f(xy)(f(x) - f(y)) = (x-y)f(x)f(y) for all x,yx,y .

Attachments:

logo01.gif

A5

Find all positive integers a1,a2,…,ana_1, a_2, \ldots, a_n such that

99100=a0a1+a1a2+⋯+an−1an,\frac{99}{100} = \frac{a_0}{a_1} + \frac{a_1}{a_2} + \cdots + \frac{a_{n-1}}{a_n}, where a0=1a_0 = 1 and (ak+1−1)ak−1≥ak2(ak−1)(a_{k+1}-1)a_{k-1} \geq a_k^2(a_k - 1) for k=1,2,…,n−1k = 1,2,\ldots,n-1 .

Attachments:

logo01.gif

C4

A set of three nonnegative integers {x,y,z}\{x,y,z\} with x<y<zx < y < z is called historic if {z−y,y−x}={1776,2001}\{z-y,y-x\} = \{1776,2001\} . Show that the set of all nonnegative integers can be written as the union of pairwise disjoint historic sets.

Attachments:

logo01.gif

C5

Find all finite sequences (x0,x1,…,xn)(x_0, x_1, \ldots,x_n) such that for every jj , 0≤j≤n0 \leq j \leq n , xjx_j equals the number of times jj appears in the sequence.

Attachments:

logo01.gif

C6

For a positive integer nn define a sequence of zeros and ones to be balanced if it contains nn zeros and nn ones. Two balanced sequences aa and bb are neighbors if you can move one of the 2n2n symbols of aa to another position to form bb . For instance, when n=4n = 4 , the balanced sequences 0110100101101001 and 0011010100110101 are neighbors because the third (or fourth) zero in the first sequence can be moved to the first or second position to form the second sequence. Prove that there is a set SS of at most 1n+1(2nn)\frac{1}{n+1} \binom{2n}{n} balanced sequences such that every balanced sequence is equal to or is a neighbor of at least one sequence in SS .

Attachments:

logo01.gif

C7

A pile of nn pebbles is placed in a vertical column. This configuration is modified according to the following rules. A pebble can be moved if it is at the top of a column which contains at least two more pebbles than the column immediately to its right. (If there are no pebbles to the right, think of this as a column with 0 pebbles.) At each stage, choose a pebble from among those that can be moved (if there are any) and place it at the top of the column to its right. If no pebbles can be moved, the configuration is called a final configuration. For each nn , show that, no matter what choices are made at each stage, the final configuration obtained is unique. Describe that configuration in terms of nn .

IMO ShortList 2001, combinatorics problem 7, alternative

Attachments:

logo01.gif

G3

Let ABCABC be a triangle with centroid GG . Determine, with proof, the position of the point PP in the plane of ABCABC such that AP⋅AG+BP⋅BG+CP⋅CGAP{\cdot}AG + BP{\cdot}BG + CP{\cdot}CG is a minimum, and express this minimum value in terms of the side lengths of ABCABC .

Attachments:

logo01.gif

G4

Let MM be a point in the interior of triangle ABCABC . Let A′A' lie on BCBC with MA′MA' perpendicular to BCBC . Define B′B' on CACA and C′C' on ABAB similarly. Define

p(M)=MA′⋅MB′⋅MC′MA⋅MB⋅MC.p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}.

Determine, with proof, the location of MM such that p(M)p(M) is maximal. Let μ(ABC)\mu(ABC) denote this maximum value. For which triangles ABCABC is the value of μ(ABC)\mu(ABC) maximal?

Attachments:

logo01.gif

G7

Let OO be an interior point of acute triangle ABCABC . Let A1A_1 lie on BCBC with OA1OA_1 perpendicular to BCBC . Define B1B_1 on CACA and C1C_1 on ABAB similarly. Prove that OO is the circumcenter of ABCABC if and only if the perimeter of A1B1C1A_1B_1C_1 is not less than any one of the perimeters of AB1C1,BC1A1AB_1C_1, BC_1A_1 , and CA1B1CA_1B_1 .

Attachments:

logo01.gif

N2

Consider the system \begin{align*}x + y &= z + u,2xy & = zu.\end{align*} Find the greatest value of the real constant mm such that m≤x/ym \leq x/y for any positive integer solution (x,y,z,u)(x,y,z,u) of the system, with x≥yx \geq y .

Attachments:

logo01.gif

N3

Let a1=1111,a2=1212,a3=1313a_1 = 11^{11}, a_2 = 12^{12}, a_3 = 13^{13} , and an=∣an−1−an−2∣+∣an−2−an−3∣,n≥4.a_n = |a_{n - 1} - a_{n - 2}| + |a_{n - 2} - a_{n - 3}|, n \geq 4. Determine a1414a_{14^{14}} .

N4

Let p≥5p \geq 5 be a prime number. Prove that there exists an integer aa with 1≤a≤p−21 \leq a \leq p-2 such that neither ap−1−1a^{p-1}-1 nor (a+1)p−1−1(a+1)^{p-1}-1 is divisible by p2p^2 .

Attachments:

logo01.gif