olymmath

RO-TST 1990

Romanian IMO Team Selection Test 1990.

Other problems

Problem 5

Let OO be the circumcenter of an acute triangle ABCABC and RR be its circumcenter. Consider the disks having OA,OB,OCOA,OB,OC as diameters, and let Δ\Delta be the set of points in the plane belonging to at least two of the disks. Prove that the area of Δ\Delta is greater than R2/8R^2/8 .

Problem 6

Prove that there are infinitely many n's for which there exists a partition of {1,2,...,3n}\{1,2,...,3n\} into subsets {a1,...,an},{b1,...,bn},{c1,...,cn}\{a_1,...,a_n\}, \{b_1,...,b_n\}, \{c_1,...,c_n\} such that ai+bi=cia_i +b_i = c_i for all ii , and prove that there are infinitely many nn 's for which there is no such partition.

Problem 7

The sequence (xn)n≥1(x_n)_{n \geq 1} is defined by: x1=1x_1=1 xn+1=xnn+nxnx_{n+1}=\frac{x_n}{n}+\frac{n}{x_n} Prove that (xn)(x_n) increases and [xn2]=n[x_n^2]=n .

Problem 8

For a set SS of nn points, let d1>d2>...>dk>...d_1 > d_2 >... > d_k > ... be the distances between the points. A function fk:S→Nf_k: S \to N is called a coloring function if, for any pair M,NM,N of points in SS with MN≤dkMN \le d_k , it takes the value fk(M)+fk(N)f_k(M)+ f_k(N) at some point. Prove that for each m∈Nm \in N there are positive integers n,kn,k and a set SS of nn points such that every coloring function fkf_k of SS satisfies ∣fk(S)∣≤m| f_k(S)| \le m

Problem 9

The distance between any two of six given points in the plane is at least 11 . Prove that the distance between some two points is at least 5+52\sqrt{\frac{5+\sqrt5}{2}}

Problem 10

Let p,qp,q be positive prime numbers and suppose q>5q>5 . Prove that if q∣2p+3pq \mid 2^{p}+3^{p} , then q>pq>p .

Laurentiu Panaitopol

Problem 11

In a group of nn persons, (i) each person is acquainted to exactly kk others, (ii) any two acquainted persons have exactly ll common acquaintances, (iii) any two non-acquainted persons have exactly mm common acquaintances. Prove that m(n−k−1)=k(k−l−1)m(n-k -1) = k(k -l -1) .