olymmath

PL-OM 1984

Polish Mathematical Olympiad 1984.

Other problems

Problem 1

Find the number of all real functions ff which map the sum of nn elements into the sum of their images, such that fn−1f^{n-1} is a constant function and fn−2f^{n-2} is not. Here f0(x)=xf^0(x) = x and fk=f∘fk−1f^k = f \circ f^{k-1} for k≥1k \ge 1 .

Problem 2

Let nn be a positive integer. For all i,j∈{1,2,...,n}i, j \in \{1,2,...,n\} define aj,i=1a_{j,i} = 1 if j=ij = i and aj,i=0a_{j,i} = 0 otherwise. Also, for i=n+1,...,2ni = n+1,...,2n and j=1,...,nj = 1,...,n define aj,i=−1na_{j,i} = -\frac{1}{n} . Prove that for any permutation pp of the set {1,2,...,2n}\{1,2,...,2n\} the following inequality holds: ∑j=1n∣∑k=1naj,p(k)∣≥n2\sum_{j=1}^{n}\left|\sum_{k=1}^{n} a_{j,p}(k)\right| \ge \frac{n}{2}

Problem 3

Let WW be a regular octahedron and OO be its center. In a plane PP containing OO circles k1(O,r1)k_1(O,r_1) and k2(O,r2)k_2(O,r_2) are chosen so that k1⊂P∩W⊂k2k_1 \subset P\cap W \subset k_2 . Prove that r1r2≤32\frac{r_1}{r_2}\le \frac{\sqrt3}{2}

Problem 4

A coin is tossed nn times, and the outcome is written in the form ( a1,a2,...,ana_1,a_2,...,a_n ), where ai=1a_i = 1 or 22 depending on whether the result of the ii -th toss is the head or the tail, respectively. Set bj=a1+a2+...+ajb_j = a_1 +a_2 +...+a_j for j=1,2,...,nj = 1,2,...,n , and let p(n)p(n) be the probability that the sequence b1,b2,...,bnb_1,b_2,...,b_n contains the number nn . Express p(n)p(n) in terms of p(n−1)p(n-1) and p(n−2)p(n-2) .

Problem 5

A regular hexagon of side 11 is covered by six unit disks. Prove that none of the vertices of the hexagon is covered by two (or more) discs.

Problem 6

Cities P1,...,P1025P_1,...,P_{1025} are connected to each other by airlines A1,...,A10A_1,...,A_{10} so that for any two distinct cities PkP_k and PmP_m there is an airline offering a direct flight between them. Prove that one of the airlines can offer a round trip with an odd number of flights.