olymmath

ISL 2004

IMO Shortlist 2004.

Other problems

A3

Does there exist a function s ⁣:Q→{−1,1}s\colon \mathbb{Q} \rightarrow \{-1,1\} such that if xx and yy are distinct rational numbers satisfying xy=1{xy=1} or x+y∈{0,1}{x+y\in \{0,1\}} , then s(x)s(y)=−1{s(x)s(y)=-1} ? Justify your answer.

Proposed by Dan Brown, Canada

A6

Find all functions f:R→Rf:\mathbb{R} \to \mathbb{R} satisfying the equation f(x2+y2+2f(xy))=(f(x+y))2.f(x^2+y^2+2f(xy)) = (f(x+y))^2. for all x,y∈Rx,y \in \mathbb{R} .

C3

The following operation is allowed on a finite graph: Choose an arbitrary cycle of length 4 (if there is any), choose an arbitrary edge in that cycle, and delete it from the graph. For a fixed integer n≥4{n\ge 4} , find the least number of edges of a graph that can be obtained by repeated applications of this operation from the complete graph on nn vertices (where each pair of vertices are joined by an edge).

Proposed by Norman Do, Australia

C5

AA and BB play a game, given an integer NN , AA writes down 11 first, then every player sees the last number written and if it is nn then in his turn he writes n+1n+1 or 2n2n , but his number cannot be bigger than NN . The player who writes NN wins. For which values of NN does BB win?

Proposed by A. Slinko & S. Marshall, New Zealand

C8

For a finite graph GG , let f(G)f(G) be the number of triangles and g(G)g(G) the number of tetrahedra formed by edges of GG . Find the least constant cc such that g(G)3≤c⋅f(G)4g(G)^3\le c\cdot f(G)^4 for every graph GG .

Proposed by Marcin Kuczma, Poland

G5

Let A1A2A3…AnA_1A_2A_3\ldots A_n be a regular nn -gon. Let B1B_1 and Bn−1B_{n-1} be the midpoints of its sides A1A2A_1A_2 and An−1AnA_{n-1}A_n . Also, for every i∈{2,3,4,…,n−2}i\in\left\{2,3,4,\ldots ,n-2\right\} . Let SS be the point of intersection of the lines A1Ai+1A_1A_{i+1} and AnAiA_nA_i , and let BiB_i be the point of intersection of the angle bisector bisector of the angle ∡AiSAi+1\measuredangle A_iSA_{i+1} with the segment AiAi+1A_iA_{i+1} .

Prove that ∑i=1n−1∡A1BiAn=180∘\sum_{i=1}^{n-1} \measuredangle A_1B_iA_n=180^{\circ} .

Proposed by Dusan Dukic, Serbia and Montenegro

G7

For a given triangle ABCABC , let XX be a variable point on the line BCBC such that CC lies between BB and XX and the incircles of the triangles ABXABX and ACXACX intersect at two distinct points PP and Q.Q. Prove that the line PQPQ passes through a point independent of XX .

G8

Given a cyclic quadrilateral ABCDABCD , let MM be the midpoint of the side CDCD , and let NN be a point on the circumcircle of triangle ABMABM . Assume that the point NN is different from the point MM and satisfies ANBN=AMBM\frac{AN}{BN}=\frac{AM}{BM} . Prove that the points EE , FF , NN are collinear, where E=AC∩BDE=AC\cap BD and F=BC∩DAF=BC\cap DA .

Proposed by Dusan Dukic, Serbia and Montenegro

N2

The function ff from the set N\mathbb{N} of positive integers into itself is defined by the equality f(n)=∑k=1ngcd⁡(k,n),n∈N.f(n)=\sum_{k=1}^{n} \gcd(k,n), n\in \mathbb{N}. a) Prove that f(mn)=f(m)f(n)f(mn)=f(m)f(n) for every two relatively prime m,n∈N{m,n\in\mathbb{N}} .

b) Prove that for each a∈Na\in\mathbb{N} the equation f(x)=axf(x)=ax has a solution.

c) Find all a∈N{a\in\mathbb{N}} such that the equation f(x)=axf(x)=ax has a unique solution.

N6

Given an integer n>1{n>1} , denote by PnP_{n} the product of all positive integers xx less than nn and such that nn divides x2−1{x^2-1} . For each n>1{n>1} , find the remainder of PnP_{n} on division by nn .

Proposed by John Murray, Ireland

N7

Let pp be an odd prime and nn a positive integer. In the coordinate plane, eight distinct points with integer coordinates lie on a circle with diameter of length pnp^{n} . Prove that there exists a triangle with vertices at three of the given points such that the squares of its side lengths are integers divisible by pn+1p^{n+1} .

Proposed by Alexander Ivanov, Bulgaria